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:2405.08065 · Physical Review A

Direct and efficient detection of quantum superposition

Daniel Kun, Teodor Strömberg, Michele Spagnolo, Borivoje Dakić, Lee A. Rozema, Philip John Walther

Published May 16, 2025• 9 citations
arXivHTMLPDF

Abstract

One of the most striking quantum phenomena is superposition, where one particle simultaneously inhabits different states. Most methods to verify coherent superposition are indirect, in that they require the distinct states to be recombined. Here, we adapt an game, in which a “test” photon is placed in a superposition of two orthogonal spatial modes, and each mode is sent to separated parties who perform local measurements on their modes without reinterfering the original modes. We show that by using a second identical “measurement” photon the parties are nonetheless able to verify if the test photon was placed in coherent superposition of the two spatial modes. We then turn this game into a resource-efficient verification scheme, obtaining a confidence that the particle is superposed which approaches unity exponentially fast. We demonstrate our scheme using a single photon, obtaining a 99% confidence that the particle is superposed with only 37 copies. Our work shows the utility of games to verify quantum resources, allowing us to efficiently detect quantum superposition without reinterfering the superposed modes.

DOI
10.1103/physreva.111.l050402

Related papers

Direct Detection of Quantum Superposition at a Distance

Daniel Kun, Teodor Strömberg, Michele Spagnolo +2 more

Employing an XOR game, we verify quantum superposition with local measurements only, consisting of photon-counting and coincidence detection and using a second, indistinguishable photon as a shared resource, without the need to re-interfere the superposition.

Quantum 2.0 Conference and Exhibition•Jan 1, 2024•0 citations

Visibility-dependent resource scaling analysis for verifying single-particle quantum superposition via XOR games

Ting-Hsun Chien, Chieh-Yu Yao, Chun-Ming Chiang

The verification of single-particle quantum superposition states conventionally relies on the physical recombination of distinct spatial paths within an interferometer. However, this approach is highly susceptible to phase drifts and environmental noise in long-distance distributed quantum systems. To explore the feasibility of quantum verification without path recombination, this study establishes a numerical analysis model for single-particle quantum superposition based on the XOR-game framework. By introducing an ancilla photon indistinguishable from the test photon, the system analyzes the quantum verification capability through statistical correlations derived from local measurements and two-photon interference. Using the interference visibility V as the core parameter, we systematically investigate the minimum number of valid detection events required to achieve a 99% verification confidence level under different interference-quality conditions. The verification significance is evaluated using a one-sided binomial test against the classical local hidden variable (LHV) bound, with an expected-count criterion adopted to provide a deterministic resource-scaling baseline. Our numerical results show that under the ideal condition ( V =1.00), approximately 25 valid detection events are required to reach the 99% confidence threshold, whereas approximately 89 valid detection events are required at V =0.50. As the visibility decreases further, the required statistical resources increase rapidly. Quantitative fitting of the numerical confidence boundary shows that a power-law model provides a substantially better description than an exponential model, with the fitted scaling behavior close to the analytically predicted inverse-square relation N ∝ V −2 . The proposed resource analysis framework provides a quantitative baseline for evaluating the operational viability of task-based verification protocols in distributed photonic quantum architectures.

Journal of the Optical Society of America B•Sep 17, 2026•0 citations

Direct and efficient verification of entanglement between two multimode–multiphoton systems

Takayuki Kiyohara, Naoki Yamashiro, Ryo Okamoto +4 more

Linear-optic photonic networks with multiple single-photon inputs are attracting attention due to their great potential for quantum computation, quantum communication, and quantum sensing. They are also essential for verifying quantum advantages via boson sampling schemes. The quantum coherence of generated multimode–multiphoton states is crucial for various applications. However, the coherence is invisible in the normally obtained photon number distributions, which strictly limits the efficiency of entanglement verification between multimode–multiphoton systems since the required resources for quantum state tomography increase exponentially as the number of photons/modes increases. In this paper, we report the experimental demonstration of direct and efficient verification of entanglement between two multimode–multiphoton systems (one photon in three modes and two photons in three modes) using just two sets of classical correlation tables with and without a discrete Fourier transformation of the optical modes, clearly demonstrating a dramatic reduction in the resources required for entanglement verification. Our experimental demonstration paves the way to understanding the coherence and entanglement of multi-partite systems, not only for photons but for other quantum resources with high-dimensional degrees of freedom.

Optica•Sep 30, 2020•7 citations

One-Photon Measurement of Two-Photon Entanglement

Gabriela Barreto Lemos, Radek Łapkiewicz, Armin Hochrainer +2 more

Measuring entanglement is an essential step in a wide range of applied and foundational quantum experiments. When a two-particle quantum state is not pure, standard methods to measure the entanglement require detection of both particles. We realize a conceptually new method for verifying and measuring entanglement in a class of two-part (bipartite) mixed states. Contrary to the approaches known to date, in our experiment we verify and measure entanglement in mixed quantum bipartite states by detecting only one subsystem, the other remains undetected. Only one copy of the mixed or pure state is used but that state is in a superposition of having been created in two identical sources. We show that information shared in entangled systems can be accessed through single-particle interference patterns. Our experiment enables entanglement characterization even when one of the subsystems cannot be detected, for example, when suitable detectors are not available.

arXiv:2009.02851•Physical Review Letters•Mar 1, 2023•19 citations

Characterizing mixed-state entanglement through single-photon interference

Mayukh Lahiri, Radek Łapkiewicz, Armin Hochrainer +2 more

Entanglement verification and measurement is essential for experimental tests of quantum mechanics and also for quantum communication and information science. Standard methods of verifying entanglement in a bipartite mixed state require detection of both particles and involve coincidence measurement. We present a method that enables us to verify and measure entanglement in a two-photon mixed state without detecting one of the photons, i.e., without performing any coincidence measurement or postselection. We consider two identical sources, each of which can generate the same two-photon mixed state but they never emit simultaneously. We show that one can produce a set of single-photon interference patterns, which contain information about entanglement in the two-photon mixed state. We prove that it is possible to retrieve the information about entanglement from the visibility of the interference patterns. Our method reveals a distinct avenue for verifying and measuring entanglement in mixed states.

arXiv:2009.02829•Physical Review A•Jul 6, 2021•18 citations

Verification of Quantum Computations: Hardware-Efficient Security Proofs

Harold Ollivier

How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual synthesis of some recent developments toward answering this question under statistical (information-theoretic) security. Rather than duplicating the dense technical proofs of the underlying publications, our focus here is on the physical motivations, the structural connections between different protocols, and the path toward hardware-efficient implementation. We begin by introducing a modular, composable framework that partitions verification into three distinct, independent primitives: remote state preparation, trap-based deviation detection, and error-correcting embedding. Using this framework, we show how the demanding hardware requirements of early protocols can be systematically relaxed. We review schemes that eliminate the spatial overhead, remove the need to prepare computational-basis dummy states, and replace single-photon sources with trusted local rotations or weak coherent pulses. Finally, we examine how these techniques scale, both to asymmetric multi-party settings and to the delegation of fully fault-tolerant computations in the presence of gate-level noise. This document is intended as a guide to the architectural principles of practical quantum verification.

quant-pharXiv:2607.03983•Jul 7, 2026•0 citations
One of the most striking quantum phenomena is superposition, where one particle simultaneously inhabits different states. Most methods to verify coherent superposition are indirect, in that they require the distinct states to be recombined. Here, we adapt an game, in which a “test” photon is placed in a superposition of two orthogonal spatial modes, and each mode is sent to separated parties who perform local measurements on their modes without reinterfering the original modes. We show that by using a second identical “measurement” photon the parties are nonetheless able to verify if the test photon was placed in coherent superposition of the two spatial modes. We then turn this game into a resource-efficient verification scheme, obtaining a confidence that the particle is superposed which approaches unity exponentially fast. We demonstrate our scheme using a single photon, obtaining a 99% confidence that the particle is superposed with only 37 copies. Our work shows the utility of games to verify quantum resources, allowing us to efficiently detect quantum superposition without reinterfering the superposed modes.
The verification of single-particle quantum superposition states conventionally relies on the physical recombination of distinct spatial paths within an interferometer. However, this approach is highly susceptible to phase drifts and environmental noise in long-distance distributed quantum systems. To explore the feasibility of quantum verification without path recombination, this study establishes a numerical analysis model for single-particle quantum superposition based on the XOR-game framework. By introducing an ancilla photon indistinguishable from the test photon, the system analyzes the quantum verification capability through statistical correlations derived from local measurements and two-photon interference. Using the interference visibility V as the core parameter, we systematically investigate the minimum number of valid detection events required to achieve a 99% verification confidence level under different interference-quality conditions. The verification significance is evaluated using a one-sided binomial test against the classical local hidden variable (LHV) bound, with an expected-count criterion adopted to provide a deterministic resource-scaling baseline. Our numerical results show that under the ideal condition ( V =1.00), approximately 25 valid detection events are required to reach the 99% confidence threshold, whereas approximately 89 valid detection events are required at V =0.50. As the visibility decreases further, the required statistical resources increase rapidly. Quantitative fitting of the numerical confidence boundary shows that a power-law model provides a substantially better description than an exponential model, with the fitted scaling behavior close to the analytically predicted inverse-square relation N ∝ V −2 . The proposed resource analysis framework provides a quantitative baseline for evaluating the operational viability of task-based verification protocols in distributed photonic quantum architectures.
Linear-optic photonic networks with multiple single-photon inputs are attracting attention due to their great potential for quantum computation, quantum communication, and quantum sensing. They are also essential for verifying quantum advantages via boson sampling schemes. The quantum coherence of generated multimode–multiphoton states is crucial for various applications. However, the coherence is invisible in the normally obtained photon number distributions, which strictly limits the efficiency of entanglement verification between multimode–multiphoton systems since the required resources for quantum state tomography increase exponentially as the number of photons/modes increases. In this paper, we report the experimental demonstration of direct and efficient verification of entanglement between two multimode–multiphoton systems (one photon in three modes and two photons in three modes) using just two sets of classical correlation tables with and without a discrete Fourier transformation of the optical modes, clearly demonstrating a dramatic reduction in the resources required for entanglement verification. Our experimental demonstration paves the way to understanding the coherence and entanglement of multi-partite systems, not only for photons but for other quantum resources with high-dimensional degrees of freedom.
Measuring entanglement is an essential step in a wide range of applied and foundational quantum experiments. When a two-particle quantum state is not pure, standard methods to measure the entanglement require detection of both particles. We realize a conceptually new method for verifying and measuring entanglement in a class of two-part (bipartite) mixed states. Contrary to the approaches known to date, in our experiment we verify and measure entanglement in mixed quantum bipartite states by detecting only one subsystem, the other remains undetected. Only one copy of the mixed or pure state is used but that state is in a superposition of having been created in two identical sources. We show that information shared in entangled systems can be accessed through single-particle interference patterns. Our experiment enables entanglement characterization even when one of the subsystems cannot be detected, for example, when suitable detectors are not available.
Entanglement verification and measurement is essential for experimental tests of quantum mechanics and also for quantum communication and information science. Standard methods of verifying entanglement in a bipartite mixed state require detection of both particles and involve coincidence measurement. We present a method that enables us to verify and measure entanglement in a two-photon mixed state without detecting one of the photons, i.e., without performing any coincidence measurement or postselection. We consider two identical sources, each of which can generate the same two-photon mixed state but they never emit simultaneously. We show that one can produce a set of single-photon interference patterns, which contain information about entanglement in the two-photon mixed state. We prove that it is possible to retrieve the information about entanglement from the visibility of the interference patterns. Our method reveals a distinct avenue for verifying and measuring entanglement in mixed states.
How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual synthesis of some recent developments toward answering this question under statistical (information-theoretic) security. Rather than duplicating the dense technical proofs of the underlying publications, our focus here is on the physical motivations, the structural connections between different protocols, and the path toward hardware-efficient implementation. We begin by introducing a modular, composable framework that partitions verification into three distinct, independent primitives: remote state preparation, trap-based deviation detection, and error-correcting embedding. Using this framework, we show how the demanding hardware requirements of early protocols can be systematically relaxed. We review schemes that eliminate the spatial overhead, remove the need to prepare computational-basis dummy states, and replace single-photon sources with trusted local rotations or weak coherent pulses. Finally, we examine how these techniques scale, both to asymmetric multi-party settings and to the delegation of fully fault-tolerant computations in the presence of gate-level noise. This document is intended as a guide to the architectural principles of practical quantum verification.