Building intuition for quantum algorithms using the Aharonov–Bohm effect

2026/07/02 by Anna Liv Paludan Bjerregaard, Kim Splittorff, K. Splittorff
Chemistry · Computer Science · Physics and Astronomy · #Advanced Physical and Chemical Molecular Interactions #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications

paper · doi:10.1088/1361-6404/ae85e7

openalex publication_date 2026/07/02 · openalex created_date 2026/07/03 · openalex updated_date 2026/07/23

Abstract

Abstract Quantum computers operate in a manner so different from classical computers that our intuition for understanding the process of quantum computation is challenged. This not only makes it hard to develop new quantum algorithms, but also makes quantum computation a difficult subject for students. Here, we show that the time evolution of a particle on a ring with a coil through it performs the key quantum algorithm known as quantum phase estimation. The example uses the Aharonov–Bohm effect, and the aim is to help students build a physical intuition for quantum algorithms.

Citations

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Significance of Electromagnetic Potentials in the Quantum Theory
• Conservation of Isotopic Spin and Isotopic Gauge Invariance
• Why haven't more quantum algorithms been found?
• Appearance of Gauge Structure in Simple Dynamical Systems
• Simulated Quantum Computation of Molecular Energies
• Quantum algorithms revisited
• Quantum Computation and Quantum Information

Related

• Quantum Phase Estimation and the Aharonov-Bohm effect
• Quantum Algorithms in the Quantum Mechanics Curriculum
• Optimizing the Phase Estimation Algorithm Applied to the Quantum Simulation of Heisenberg-Type Hamiltonians
• Universal Quantum Algorithm
• Measuring the non-Abelian Quantum Phase with the Algorithm of Quantum Phase Estimation