Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.14638 · Physical Review A

Quantum Interference Needs Convention: Overlap-Determinability and Unified No-Superposition Principle

Jeongho Bang, Kyoungho Cho, Ki Hyuk Yee

quant-phSubmitted Jan 21, 2026• Announced Jan 22, 2026• 3 citations
arXivHTMLPDF

Abstract

Quantum superposition is often phrased as the ability to add state vectors. In practice, however, the physical quantity is a ray (a rank-one projector), so each input specifies only a projector and leaves a gauge freedom in the phases of its vector representatives. This becomes a real operational barrier when one asks for a device that, given two independently prepared unknown pure states, outputs a coherent state proportional to a prescribed linear combination. We identify the missing ingredient as not probabilistic but phase-like. One needs a physical scenario that fixes a single phase convention on the relevant set of rays, so that the overlaps become well defined complex numbers. Thus, we formalize this through phase conventions and a single notion -- dubbed as "overlap-determinability." Our main theorem gives an exact equivalence: A nonzero completely positive trace-nonincreasing map that probabilistically produces superposition on a domain exists if and only if that domain is overlap-determinable. This unifies modern no-superposition results and characterizes the exceptional yes-go protocols, which succeed precisely when side information supplies the required missing resource. We then show that granting universal access to such convention-fixed overlaps destabilizes the familiar foundational and computational constraints. It enables forbidden transformations akin to quantum cloning and yields super-luminal signaling. It would also permit reflections about unknown states, leading to exponentially fast overlap amplification and a collapse of Grover's search lower bound to a logarithmic query complexity.

Journal reference
Phys. Rev. A 114, 032447 (2026)
DOI
10.1103/s3mc-38zd
Comments
24 pages, 1 figure

Related papers

Phase-Flag Access and No-Go Constraints on Quotient-Space Real Quantum Mechanics

Jeongho Bang, Kyoungho Cho, Kyunghyun Baek

Barrios Hita et al. [Phys. Rev. Lett. 136, 240202 (2026)] proposed a quotient-space formulation of quantum mechanics over the real numbers and concluded that complex numbers are only a convenience. A preceding analysis [arXiv:2607.05865] showed that, when the construction is empirically equivalent to complex quantum mechanics, its real flag is protected by a hidden complex structure $\hat{J}$ and its composition rule is the balanced tensor product over that structure. Here we ask what would follow from the stronger operational reading that the flag is an accessible real degree of freedom. The answer is a direct clash with overlap-determinability (OD), introduced in [arXiv:2601.14638], and with standard no-go theorems. A readable or coherently controllable flag fixes a representative of each ray, and hence supplies precisely the phase convention that OD identifies as the missing resource for universal superposition of unknown states. Once promoted to a generic phase-access primitive, this resource enables probabilistic cloning of a linearly dependent set, steering-based signaling, and logarithmic-query unstructured search. Thus the quotient construction has a sharp follow-up interpretation: as a protected gauge representation it is standard complex quantum mechanics in real notation; as an accessible real theory it leaves the quantum operational framework.

quant-pharXiv:2609.20226•Jul 28, 2026•0 citations

Creating a Superposition of Unknown Quantum States

Michał Oszmaniec, Andrzej Grudka, Michał Horodecki +1 more

The superposition principle is one of the landmarks of quantum mechanics. The importance of quantum superpositions provokes questions about the limitations that quantum mechanics itself imposes on the possibility of their generation. In this work, we systematically study the problem of the creation of superpositions of unknown quantum states. First, we prove a no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. Second, we provide an explicit probabilistic protocol generating a superposition of two unknown states, each having a fixed overlap with the known referential pure state. The protocol can be applied to generate coherent superposition of results of independent runs of subroutines in a quantum computer. Moreover, in the context of quantum optics it can be used to efficiently generate highly nonclassical states or non-Gaussian states.

arXiv:1505.04955•Physical Review Letters•Mar 17, 2016•68 citations

Impossibility of creating a superposition of unknown quantum states

Somshubhro Bandyopadhyay

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.

arXiv:2011.02275•Physical Review A•Nov 23, 2020•7 citations

Learning at the Edge of Causality: Optimal Learning-Sample Complexity from No-Signaling Constraints

Jeongho Bang, Kyoungho Cho, Jeongwoo Jae

What ultimately fixes the sample cost of quantum learning -- algorithmic ingenuity or physical law? We study this question in an arena where computation, learning, and causality collide. A twist on Grover's search that reflects about an a priori unknown state can collapse the query complexity from $O(\sqrt{N})$ to $O(\log N)$ over a search space $N$, i.e., an exponential speedup. Yet, standard quantum theory forbids such a unknown-state reflection (no-reflection theorem). We therefore build a state-learning-assisted architecture, called ``amplify-learn,'' which alternates the coherent amplitude amplification with state learning. Embedding this amplify-learn into the Bao-Bouland-Jordan no-signaling framework, we show that the logarithmic-round dream would open a super-luminal communication channel unless each round expends the learning-sample and reflection-circuit budgets scaling at least as $Ω(\sqrt{N}/\log N)$. In parallel, we derive tight computational learning-theoretic sample bounds for learning circuit-generated pure states, revealing a state-universal ansatz ``lock'' at order $N$ in the worst case. The dramatic closure is that no-signaling does not merely veto the unphysical primitive, but it fixes the only consistent reflection-circuit complexity, and feeding this causality-enforced complexity into the computational learning bound makes it collapse onto the very same $\sqrt{N}/\log N$ scaling demanded by no-signaling alone. No-signaling thus acts as a regulator of learnability: a constraint that mediates between physics and computation, welding query, gate, and sample complexities into a single causality-compatible triangle.

quant-pharXiv:2601.12651•Jan 20, 2026•3 citations

Experimental creation of superposition of unknown photonic quantum states

Xiao‐Min Hu, Mengjun Hu, Jiangshan Chen +5 more

As one of the most intriguing intrinsic properties of the quantum world, quantum superposition provokes great interest in its own generation. Though a universal quantum machine that creates superposition of two arbitrary unknown states has been shown to be physically impossible, a probabilistic protocol exists given that two input states have nonzero overlaps with the referential state. Here we report a probabilistic quantum machine realizing superposition of two arbitrary unknown photonic qubits as long as they have nonzero overlaps with the horizontal polarization state $|H\ensuremath{\rangle}$. A total of 11 different qubit pairs are chosen to test this protocol and we obtain the average fidelity as high as 0.99, which shows the excellent reliability of our realization. This realization may have significant applications in quantum information and quantum computation, e.g., generating nonclassical states and realizing information compression in a quantum computation.

arXiv:1605.02339•Physical Review A•Sep 22, 2016•19 citations

Experimentally superposing two pure states with partial prior knowledge

Keren Li, Guofei Long, Hemant Katiyar +4 more

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.

arXiv:1608.04349•Physical Review A•Feb 23, 2017•19 citations
Quantum superposition is often phrased as the ability to add state vectors. In practice, however, the physical quantity is a ray (a rank-one projector), so each input specifies only a projector and leaves a gauge freedom in the phases of its vector representatives. This becomes a real operational barrier when one asks for a device that, given two independently prepared unknown pure states, outputs a coherent state proportional to a prescribed linear combination. We identify the missing ingredient as not probabilistic but phase-like. One needs a physical scenario that fixes a single phase convention on the relevant set of rays, so that the overlaps become well defined complex numbers. Thus, we formalize this through phase conventions and a single notion -- dubbed as "overlap-determinability." Our main theorem gives an exact equivalence: A nonzero completely positive trace-nonincreasing map that probabilistically produces superposition on a domain exists if and only if that domain is overlap-determinable. This unifies modern no-superposition results and characterizes the exceptional yes-go protocols, which succeed precisely when side information supplies the required missing resource. We then show that granting universal access to such convention-fixed overlaps destabilizes the familiar foundational and computational constraints. It enables forbidden transformations akin to quantum cloning and yields super-luminal signaling. It would also permit reflections about unknown states, leading to exponentially fast overlap amplification and a collapse of Grover's search lower bound to a logarithmic query complexity.
Barrios Hita et al. [Phys. Rev. Lett. 136, 240202 (2026)] proposed a quotient-space formulation of quantum mechanics over the real numbers and concluded that complex numbers are only a convenience. A preceding analysis [arXiv:2607.05865] showed that, when the construction is empirically equivalent to complex quantum mechanics, its real flag is protected by a hidden complex structure J^\hat{J}J^ and its composition rule is the balanced tensor product over that structure. Here we ask what would follow from the stronger operational reading that the flag is an accessible real degree of freedom. The answer is a direct clash with overlap-determinability (OD), introduced in [arXiv:2601.14638], and with standard no-go theorems. A readable or coherently controllable flag fixes a representative of each ray, and hence supplies precisely the phase convention that OD identifies as the missing resource for universal superposition of unknown states. Once promoted to a generic phase-access primitive, this resource enables probabilistic cloning of a linearly dependent set, steering-based signaling, and logarithmic-query unstructured search. Thus the quotient construction has a sharp follow-up interpretation: as a protected gauge representation it is standard complex quantum mechanics in real notation; as an accessible real theory it leaves the quantum operational framework.
The superposition principle is one of the landmarks of quantum mechanics. The importance of quantum superpositions provokes questions about the limitations that quantum mechanics itself imposes on the possibility of their generation. In this work, we systematically study the problem of the creation of superpositions of unknown quantum states. First, we prove a no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. Second, we provide an explicit probabilistic protocol generating a superposition of two unknown states, each having a fixed overlap with the known referential pure state. The protocol can be applied to generate coherent superposition of results of independent runs of subroutines in a quantum computer. Moreover, in the context of quantum optics it can be used to efficiently generate highly nonclassical states or non-Gaussian states.
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.
What ultimately fixes the sample cost of quantum learning -- algorithmic ingenuity or physical law? We study this question in an arena where computation, learning, and causality collide. A twist on Grover's search that reflects about an a priori unknown state can collapse the query complexity from O(N)O(\sqrt{N})O(N​) to O(log⁡N)O(\log N)O(logN) over a search space NNN, i.e., an exponential speedup. Yet, standard quantum theory forbids such a unknown-state reflection (no-reflection theorem). We therefore build a state-learning-assisted architecture, called ``amplify-learn,'' which alternates the coherent amplitude amplification with state learning. Embedding this amplify-learn into the Bao-Bouland-Jordan no-signaling framework, we show that the logarithmic-round dream would open a super-luminal communication channel unless each round expends the learning-sample and reflection-circuit budgets scaling at least as Ω(N/log⁡N)Ω(\sqrt{N}/\log N)Ω(N​/logN). In parallel, we derive tight computational learning-theoretic sample bounds for learning circuit-generated pure states, revealing a state-universal ansatz ``lock'' at order NNN in the worst case. The dramatic closure is that no-signaling does not merely veto the unphysical primitive, but it fixes the only consistent reflection-circuit complexity, and feeding this causality-enforced complexity into the computational learning bound makes it collapse onto the very same N/log⁡N\sqrt{N}/\log NN​/logN scaling demanded by no-signaling alone. No-signaling thus acts as a regulator of learnability: a constraint that mediates between physics and computation, welding query, gate, and sample complexities into a single causality-compatible triangle.
As one of the most intriguing intrinsic properties of the quantum world, quantum superposition provokes great interest in its own generation. Though a universal quantum machine that creates superposition of two arbitrary unknown states has been shown to be physically impossible, a probabilistic protocol exists given that two input states have nonzero overlaps with the referential state. Here we report a probabilistic quantum machine realizing superposition of two arbitrary unknown photonic qubits as long as they have nonzero overlaps with the horizontal polarization state $|H\ensuremath{\rangle}$. A total of 11 different qubit pairs are chosen to test this protocol and we obtain the average fidelity as high as 0.99, which shows the excellent reliability of our realization. This realization may have significant applications in quantum information and quantum computation, e.g., generating nonclassical states and realizing information compression in a quantum computation.
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.