Universal superposition of arbitrary orthogonal states

Abstract

It is known that no quantum process can produce a predetermined superposition of unknown arbitrary states. It has already been shown that with some partial information about the states, one can produce with some probability such superpositions. Here we show that there are universal machines which can produce superpositions of unknown orthogonal states with unit probability. Our construction unravels the relation between the no-cloning theorem and the no-superposition theorem, that is we show that if a perfect cloning machine exists, then a universal superposition machine can also exist.

arXiv comment13 pages, 2 figures, Accepted for publication in Physical Review A

References in corpus (11)

• Quantum Cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Advances in Quantum Metrology
• Noncommuting mixed states cannot be broadcast
• No-local-broadcasting theorem for quantum correlations
• Impossibility of deleting an unknown quantum state
• Creation of superposition of unknown quantum states
• General impossible operations in quantum information
• The Forbidden Quantum Adder
• Superposing pure quantum states with partial prior information
• Unified quantum no-go theorems and transforming of quantum states in a restricted set

Cited by in corpus (9)

• Quantum Physical Unclonable Functions: Possibilities and Impossibilities
• Superposing pure quantum states with partial prior information
• Quantum information masking of an arbitrary qudit can be realized in multipartite lower dimensional systems
• Impossibility of creating a superposition of unknown quantum states
• Quantum coherence between subspaces: State transformation, Cohering Power, $k$-coherence and other properties
• Characterizing the superposition of arbitrary random quantum states and a known quantum state
• Creation of superposition of arbitrary states encoded in two three-dimensional cavities
• Topologically driven no-superposing theorem with a tight error bound
• Optimal Quantum Subtracting Machine