To better understand quantum computation we can search for its limits or no-gos, especially if analogous limits do not appear in classical computation. Classical computation easily implements and extensively employs the addition of two bit strings, so here we study 'quantum addition': the superposition of two quantum states. We prove the impossibility of superposing two unknown states, no matter how many samples of each state are available. The proof uses topology; a quantum algorithm of any sample complexity corresponds to a continuous function, but the function required by the superposition task cannot be continuous by topological arguments. Our result for the first time quantifies the approximation error and the sample complexity N of the superposition task, and it is tight. We present a trivial algorithm with a large approximation error and N = 1 , and the matching impossibility of any smaller approximation error for any N . Consequently, our results limit state tomography as a useful subroutine for the superposition. State tomography is useful only in a model that tolerates randomness in the superposed state. The optimal protocol in this random model remains open.
The superposition principle is fundamental to quantum theory. Yet a recent no-go theorem has proved that quantum theory forbids superposition of unknown quantum states, even with nonzero probability. The implications of this result, however, remain poorly understood so far. In this Rapid Communication we show that the existence of a protocol that superposes two unknown pure states with nonzero probability (allowed to vary over input states) leads to the violation of other no-go theorems. In particular, such a protocol can be used to perform certain state discrimination and cloning tasks that are forbidden not only in quantum theory but in no-signaling theories as well.
The no-cloning theorem is a cornerstone result in quantum mechanics that forbids copying of general quantum information. More quantitatively, even given
N copies of an unknown state, any channel producing an
(N+1)-copy state incurs a nonzero trace-distance error on some inputs. Turning this around, one can ask about the sample complexity of approximate
N→N+1 cloning: for a desired small error
ε, what
N suffices? For arbitrary pure states on a Hilbert space
H, the answer is
N≃dimH/ε - astronomically large for most
H of interest. What if the input is promised to lie in a structured family? We examine a range of families fundamental to many-body physics and quantum information:
n-mode fermionic Gaussian and Slater states,
n-mode bosonic Gaussian states, and qudit phase states. For fermions, we construct optimal cloning channels, reducing the complexity from exponential to polynomial in
n. For bosonic Gaussian states, we construct an explicit cloner that certifies polynomial complexity, without any constraint on the energy of the state; this channel, however, is not optimal in general. The fermionic and bosonic results follow from a single representation-theoretic framework, which generalizes previous work by Werner and by Chiribella and Yang; it also yields the cloners' unitary implementation. Furthermore, we explain why for many families the cloning complexity is linear in the dimension of the family manifold, via a controlled saddle-point evaluation of the frame potential at high
N. The same calculation accounts for the analogous scaling of tomography complexity. The above framework does not cover phase states; for these we give an independent construction of a channel with optimal cloning fidelity. Our work complements recent results on cloning stabilizer states.
Algorithms with unitary oracles can be nested, which makes them extremely versatile. An example is the phase estimation algorithm used in many candidate algorithms for quantum speedup. The search for new quantum algorithms benefits from understanding their limitations: Some tasks are impossible in quantum circuits, although their classical versions are easy, for example, cloning. An example with a unitary oracle U is the if clause, the task to implement controlled U (up to the phase on U ). In classical computation the conditional statement is easy and essential. In quantum circuits the if clause was shown impossible from one query to U . Is it possible from polynomially many queries? Here we unify algorithms with a unitary oracle and develop a topological method to prove their limitations: No number of queries to U and U† lets quantum circuits implement the if clause, even if admitting approximations, postselection, and relaxed causality. We also show limitations of process tomography, oracle neutralization, and UdimU, UT , and U† algorithms. Our results strengthen an advantage of linear optics, challenge the experiments on relaxed causality, and motivate new algorithms with many-outcome measurements. Published by the American Physical Society 2024
Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states remains as a daunting challenge. Recently, it was proved that such a quantum protocol does not exist if the two input states are completely unknown, whereas a probabilistic protocol is still available with some prior knowledge about the input states [M. Oszmaniec et al., Phys. Rev. Lett. 116, 110403 (2016)]. The knowledge is that both of the two input states have nonzero overlaps with some given referential state. In this work, we experimentally realize the probabilistic protocol of superposing two pure states in a three-qubit nuclear magnetic resonance system. We demonstrate the feasibility of the protocol by preparing a families of input states, and the average fidelity between the prepared state and expected superposition state is over 99%. Moreover, we experimentally illustrate the limitation of the protocol that it is likely to fail or yields very low fidelity, if the nonzero overlaps are approaching zero. Our experimental implementation can be extended to more complex situations and other quantum systems.
Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demonstrate that a quantum adder, in absence of an ancillary system, is also forbidden for a known orthonormal basis. This allows us to propose an approximate quantum adder that could be implemented in the lab. Finally, we discuss the distinct character of the forbidden quantum adder for quantum states and the allowed quantum adder for density matrices.