• Corpus ID: 248227794

Topological obstructions to implementing quantum if-clause

  title={Topological obstructions to implementing quantum if-clause},
  author={Zuzana Gavorov'a and Matan Seidel and Yonathan Touati},
Some tasks are impossible in a quantum circuit, even though their classical versions are easy in a classical circuit. An example with far-reaching consequences is cloning [1]. Another task commonly used in classical computation is the if-clause. Its quantum version applies an unknown n -qubit unitary U P U p 2 n q if and only if a control qubit is 1. We identify it with control φ p U q “ | 0 (cid:105)(cid:104) 0 |b I ` e iφ p U q | 1 (cid:105)(cid:104) 1 |b U , for any real function φ . It was… 

Figures and Tables from this paper



Topologically-driven impossibility of superposing unknown states

Surprisingly, it is proved that quantum circuits of any sample complexity cannot output a superposition for all input state-pairs – not even when postselection and approximations are allowed.

Computational advantage from quantum-controlled ordering of gates.

It is shown that this model of quantum computing is physically realizable, by proposing an interferometric setup that can implement such a quantum control of the order between the gates, and that this new resource provides a reduction in computational complexity.

Quantum circuits cannot control unknown operations

It is argued that one should extend the quantum circuit formalism to capture the possibility of implementing quantum control of unknown unitary in practice by allowing unknown unitaries to be applied to subspaces and not only to subsystems.

Quantum lower bounds by polynomials

This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.

Quantum circuits with mixed states

A solution for the subroutine problem: the general function that a quantum circuit outputs is a probabilistic function, but using pure state language, such a function can not be used as a black box in other computations.

Quantum plug n’ play: modular computation in the quantum regime

A ‘no-go’ theorem is demonstrated, stipulating that it is not always possible to make use of quantum circuits without knowing their construction, and a workaround capable of restoring modularity is developed.

Elementary gates for quantum computation.

U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.

Quantum lower bounds for approximate counting via laurent polynomials

  • S. Aaronson
  • Computer Science, Mathematics
    Electron. Colloquium Comput. Complex.
  • 2018
The complexity of approximate counting, the problem of multiplicatively estimating the size of a nonempty set S ⊆ [N], is resolved in two natural generalizations of quantum query complexity.

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations.

With this numerical approach, it is shown for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

Impossibility of deleting an unknown quantum state

The linearity of quantum theory does not allow us to delete a copy of an arbitrary quantum state perfectly, and this could in principle be useful in quantum computation, where one could store new information in an already computed state by deleting the old information.