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•21 citations

Understanding the role of entanglement in quantum computing

Benoît Vermersch

•Sep 1, 2022•0 citations

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•6 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•10 citations

Quantum entanglement and quantum computing

F.J. Duarte

Institute of Physics eBooks•Oct 1, 2019•4 citations

Introduction to Quantum Algorithms

Santanu Pattanayak

In 1981 Richard Feynman proposed the idea that a computer built of quantum mechanical elements obeying quantum mechanical laws can perform efficient simulations of quantum systems. Quantum computing works on the laws of quantum mechanical properties such as superposition, entanglement, and interference. Unlike in classical computing, in quantum computers a register can exist in all possible states at once due to its superposition properties. It is only when a quantum system is measured that we observe one of the possible states. Such a system is advantageous since, when measured, each state can appear with a certain probability encoded in the state prior to the measurement. Quantum computing works by increasing the probability of the desired state to a sufficiently high value so that the desired state can be obtained with high confidence with a minimal number of measurements. In this regard, quantum interference, which results from quantum superposition, plays a big role since it allows probability amplitudes corresponding to a given state to interfere and cancel each other. This property of quantum interference biases the measurement to a set of states that we desire as the outcome of quantum algorithms. Similarly, quantum entanglement allows one to create a strong correlation between quantum objects, especially qubits, to the advantage of quantum algorithms, as you will see throughout this chapter.

Apress eBooks•Jan 1, 2021•1 citation
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.
In 1981 Richard Feynman proposed the idea that a computer built of quantum mechanical elements obeying quantum mechanical laws can perform efficient simulations of quantum systems. Quantum computing works on the laws of quantum mechanical properties such as superposition, entanglement, and interference. Unlike in classical computing, in quantum computers a register can exist in all possible states at once due to its superposition properties. It is only when a quantum system is measured that we observe one of the possible states. Such a system is advantageous since, when measured, each state can appear with a certain probability encoded in the state prior to the measurement. Quantum computing works by increasing the probability of the desired state to a sufficiently high value so that the desired state can be obtained with high confidence with a minimal number of measurements. In this regard, quantum interference, which results from quantum superposition, plays a big role since it allows probability amplitudes corresponding to a given state to interfere and cancel each other. This property of quantum interference biases the measurement to a set of states that we desire as the outcome of quantum algorithms. Similarly, quantum entanglement allows one to create a strong correlation between quantum objects, especially qubits, to the advantage of quantum algorithms, as you will see throughout this chapter.