Physica Scripta

Quantum Interferometers as Quantum Computers

ARTUR K. EKERT

Published Jan 1, 1998• 15 citations

Abstract

Quantum computers which use quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations can be viewed as multiparticle interferometers. I discuss this approach to quantum computation and argue that it provides additional insights into the nature of quantum algorithms.

DOI: 10.1238/physica.topical.076a00218

Related papers

Quantum algorithms revisited

Richard Cleve, ARTUR K. EKERT, Chiara Macchiavello +1 more

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference. We use this approach to review (and improve) some of the existing quantum algorithms and to show how they are related to different instances of quantum phase estimation. We provide an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision.

arXiv:quant-ph/9708016Proceedings of the Royal Society A Mathematical Physical and Engineering SciencesJan 8, 19981,300 citations

On Quantum Algorithms

Richard Cleve, ARTUR K. EKERT, Leah Henderson +2 more

Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.

arXiv:quant-ph/9903061Mar 17, 19990 citations

On Quantum Algorithms

Richard Cleve, ARTUR K. EKERT, Henderson, L +2 more

Jan 1, 199821 citations

Quantum algorithms

Bilha Segev

I review a few of the most famous quantum algorithms, and discuss them from a practical perspective. What should a quantum system be able to do, in principle, to qualify as a quantum computer for which these algorithms work? The role of superposition, parallelism, and entanglement is discussed.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEJul 31, 20020 citations

Light as a Quantum Agent: Bridging Path Integrals and Reinforcement Learning

Bhushan Bhoja Poojary

We propose a novel and interdisciplinary conceptual framework that bridges Feynman’s path integral formulation of quantum mechanics with reinforcement learning (RL) in artificial intelligence. In the path integral approach, a quantum system does not follow a single predetermined trajectory but instead explores all possible paths simultaneously, assigning each a complex amplitude weighted by eiS/h, where S represents the classical action. Constructive and destructive interference across these paths acts as a natural filter, amplifying trajectories of stationary action and suppressing suboptimal ones, thereby leaving paths of least action as the observable outcomes. We argue this process is strongly analogous to a quantum agent evaluating an entire policy space in superposition, where interference effectively encodes a reward mechanism that eliminates non-optimal policies. This perspective not only deepens our understanding of light’s propagation in complex refractive media but also inspires the design of quantum-inspired Reinforcement learning architectures capable of leveraging the intrinsic parallelism of quantum mechanics. Furthermore, the advent of quantum computing, with its inherent properties of superposition, entanglement, and quantum interference, provides a tangible pathway for implementing such algorithms in practice. To illustrate this paradigm, we propose a toy model wherein policies are encoded as quantum states, rewards are mapped to phase shifts, and measurement collapses the superposed state into an optimal policy. The implications of this framework extend beyond algorithmic innovation, offering insights into the possibility that nature itself operates as a quantum learning system, with physical laws emerging from a process akin to reinforcement learning.

American Journal of Modern PhysicsSep 9, 20251 citation

Single photons in an interferometer:Forbidden outcomes

S. van den Hoven

The well-known Hong-Ou-Mandel (HOM) effect is the first demonstration of perfect destructive interference of quantum amplitudes in a linear optical system with single photon Fock-states at input. A natural question to ask is whether we are able to predict similar behavior for systems of a general size, that is, predicting forbidden transitions for a given input state and a given linear optical system. Previous studies have found that certain symmetries between the input and output configuration in combination with a symmetric interferometer will always result into so called suppressions. But recently, a few examples have been found of suppressions which do not obey the suppression laws constructed in previous studies. In this work, we parametrize a general three-mode interferometer and we use a numerical optimization algorithm in order to find all three-mode interferometers that demonstrate forbidden transitions. These results help us to gain a better understanding of the fundamental reason behind suppressions. In addition, we compare the quality of the different interferometers for applications in quantum tomography.

Oct 16, 20230 citations