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

The Role of Interference and Entanglement in Quantum Computing.

Jurgen Van Gael

Published Jan 1, 2005• 3 citations
OpenAlex

Related papers

The Role of Quantum Interference in Quantum Computing

Anwar Y. Shiekh

arXiv:cs/0507003•International Journal of Theoretical Physics•Aug 5, 2006•16 citations

Role of entanglement in quantum computation

Arun Kumar Pati, Samuel L. Braunstein

Journal of the Indian Institute of Science•Jan 1, 2009•6 citations

Understanding the role of entanglement in quantum computing

Benoît Vermersch

•Sep 1, 2022•0 citations

Advanced Quantum Computing: Interference and Entanglement

Between science and economics•Apr 1, 2020•1 citation

Role of interference and entanglement in quantum neural processing

Alexandr Alexandrovich Ezhov, G. P. Berman

The role of interference and entanglement in quantum neural processing is discussed. It is argued that on contrast to the quantum computing the problem of the use of exponential resources as the payment for the absence of entanglement does not exist for quantum neural processing. This is because of corresponding systems, as any modern classical artificial neural system, do not realize functions precisely, but approximate them by training on small sets of examples. It can permit to implement quantum neural systems optically, because in this case there is no need in exponential resources of optical devices (beam-splitters etc.). On the other hand, the role of entanglement in quantum neural processing is still very important, because it actually associates qubit states: this is necessary feature of quantum neural memory models.

arXiv:quant-ph/0112082•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 21, 2001•5 citations

Role of Coherence for Quantum Computational Advantage

Hugo Thomas, Pierre-Emmanuel Emeriau, Rawad Mezher +3 more

Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness, and coherence are arguably of great significance. We introduce "path coherence" as a measure of the coherent path interferences arising in a quantum computation. Leveraging the sum-over-paths formalism, we obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence. As path coherence relates to the hardness of classical estimation of quantum transition amplitudes, it provides a new perspective on the role of coherence in quantum computational advantage. Beyond their fundamental significance, our results have practical applications for simulating large classes of quantum computations with classical computers.

arXiv:2410.07024•Physical Review Letters•Aug 15, 2025•5 citations
The role of interference and entanglement in quantum neural processing is discussed. It is argued that on contrast to the quantum computing the problem of the use of exponential resources as the payment for the absence of entanglement does not exist for quantum neural processing. This is because of corresponding systems, as any modern classical artificial neural system, do not realize functions precisely, but approximate them by training on small sets of examples. It can permit to implement quantum neural systems optically, because in this case there is no need in exponential resources of optical devices (beam-splitters etc.). On the other hand, the role of entanglement in quantum neural processing is still very important, because it actually associates qubit states: this is necessary feature of quantum neural memory models.
Quantifying the resources available to a quantum computer appears to be necessary to separate quantum from classical computation. Among them, entanglement, nonstabilizerness, and coherence are arguably of great significance. We introduce "path coherence" as a measure of the coherent path interferences arising in a quantum computation. Leveraging the sum-over-paths formalism, we obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence. As path coherence relates to the hardness of classical estimation of quantum transition amplitudes, it provides a new perspective on the role of coherence in quantum computational advantage. Beyond their fundamental significance, our results have practical applications for simulating large classes of quantum computations with classical computers.