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:2111.03203 · Quantum Studies Mathematics and Foundations

A possible solution to the which-way problem of quantum interference

Holger F. Hofmann, Tomonori Matsushita, Shunichi Kuroki, M. Iinuma

Published Jun 12, 2023• 11 citations
arXivHTMLPDF
DOI
10.1007/s40509-023-00304-5

Related papers

A quantum mechanical model of interference

A. Shalom, J. Žák

Physics Letters A•Feb 1, 1973•2 citations

Deriving Grover's lower bound from simple physical principles

Ciarán M. Lee, John H. Selby

Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key resource behind this computational speed-up. However there is a limit to this interference, at most pairs of paths can ever interact in a fundamental way. Could more interference imply more computational power? Sorkin has defined a hierarchy of possible interference behaviours—currently under experimental investigation—where classical theory is at the first level of the hierarchy and quantum theory belongs to the second. Informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In this work, we consider how Grover's speed-up depends on the order of interference in a theory. Surprisingly, we show that the quadratic lower bound holds regardless of the order of interference. Thus, at least from the point of view of the search problem, post-quantum interference does not imply a computational speed-up over quantum theory.

arXiv:1604.03118•New Journal of Physics•Sep 23, 2016•40 citations

Quantum interference and the quantum potential

Chris Philippidis, Christopher Dewdney, Basil J. Hiley

Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B•Jul 1, 1979•383 citations

A possible solution to the which-way problem by asymmetrical double-slit experiments

Thuan Vo Van

Abstract The recent state-of-the-art double-slit experiments with single electrons and single photons seem to emphasize a contradictable dilemma concerning the ontological physical reality in quantum physics. Because of the importance of this problem, we propose and perform another modified laser-beam asymmetrical double-slit experiment with a constraint of single-photon interference. In the results, a Feynman condition with a mobile closing mask allows assessing the complementary contributions of photons passing through one or another slit. Under the assumption of applicable self-interference, a ‘which-way’ phenomenon is observed quantitatively in the vicinity of the main minima with low-intense interference fringes, demonstrating a possible solution to this problem. The result would encourage similar asymmetrical double-slit experiments with truly single photons or single electrons for consistent and direct observation of the wave-particle duality.

Physica Scripta•Aug 3, 2021•6 citations

Interference in Quantum Mechanics

Urbasi Sinha, Debadrita Ghosh

arXiv:2508.12940•Journal of the Indian Institute of Science•Jan 1, 2025•3 citations

Holographic Algorithms

Leslie Gabriel Valiant

Complexity theory is built fundamentally on the notion of efficient reduction among computational problems. Classical reductions involve gadgets that map solution fragments of one problem to solution fragments of another in one-to-one, or possibly one-to-many, fashion. In this paper we propose a new kind of reduction that allows for gadgets with many-to-many correspondences, in which the individual correspondences among the solution fragments can no longer be identified. Their objective may be viewed as that of generating interference patterns among these solution fragments so as to conserve their sum. We show that such holographic reductions provide a method of translating a combinatorial problem to finite systems of polynomial equations with integer coefficients such that the number of solutions of the combinatorial problem can be counted in polynomial time if one of the systems has a solution over the complex numbers. We derive polynomial time algorithms in this way for a number of problems for which only exponential time algorithms were known before. General questions about complexity classes can also be formulated. If the method is applied to a #P-complete problem, then polynomial systems can be obtained, the solvability of which would imply P$^{{\tiny{#P}}}$ = NC2.

SIAM Journal on Computing•Jan 1, 2008•229 citations
Grover's algorithm constitutes the optimal quantum solution to the search problem and provides a quadratic speed-up over all possible classical search algorithms. Quantum interference between computational paths has been posited as a key resource behind this computational speed-up. However there is a limit to this interference, at most pairs of paths can ever interact in a fundamental way. Could more interference imply more computational power? Sorkin has defined a hierarchy of possible interference behaviours—currently under experimental investigation—where classical theory is at the first level of the hierarchy and quantum theory belongs to the second. Informally, the order in the hierarchy corresponds to the number of paths that have an irreducible interaction in a multi-slit experiment. In this work, we consider how Grover's speed-up depends on the order of interference in a theory. Surprisingly, we show that the quadratic lower bound holds regardless of the order of interference. Thus, at least from the point of view of the search problem, post-quantum interference does not imply a computational speed-up over quantum theory.
Abstract The recent state-of-the-art double-slit experiments with single electrons and single photons seem to emphasize a contradictable dilemma concerning the ontological physical reality in quantum physics. Because of the importance of this problem, we propose and perform another modified laser-beam asymmetrical double-slit experiment with a constraint of single-photon interference. In the results, a Feynman condition with a mobile closing mask allows assessing the complementary contributions of photons passing through one or another slit. Under the assumption of applicable self-interference, a ‘which-way’ phenomenon is observed quantitatively in the vicinity of the main minima with low-intense interference fringes, demonstrating a possible solution to this problem. The result would encourage similar asymmetrical double-slit experiments with truly single photons or single electrons for consistent and direct observation of the wave-particle duality.
Complexity theory is built fundamentally on the notion of efficient reduction among computational problems. Classical reductions involve gadgets that map solution fragments of one problem to solution fragments of another in one-to-one, or possibly one-to-many, fashion. In this paper we propose a new kind of reduction that allows for gadgets with many-to-many correspondences, in which the individual correspondences among the solution fragments can no longer be identified. Their objective may be viewed as that of generating interference patterns among these solution fragments so as to conserve their sum. We show that such holographic reductions provide a method of translating a combinatorial problem to finite systems of polynomial equations with integer coefficients such that the number of solutions of the combinatorial problem can be counted in polynomial time if one of the systems has a solution over the complex numbers. We derive polynomial time algorithms in this way for a number of problems for which only exponential time algorithms were known before. General questions about complexity classes can also be formulated. If the method is applied to a #P-complete problem, then polynomial systems can be obtained, the solvability of which would imply P$^{{\tiny{#P}}}$ = NC2.