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

Springer eBooks

Interference

Suresh Chandra, Mohit Kumar Sharma

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-55676-0_4

Related papers

Interference

Avijit Lahiri

Elsevier eBooks•Jan 1, 2016•2 citations

Quantitative measure of interference

Daniel Braun, Bertrand Georgeot

We introduce an interference measure which allows to quantify the amount of interference present in any physical process that maps an initial density matrix to a final density matrix. In particular, the interference measure enables one to monitor the amount of interference generated in each step of a quantum algorithm. We show that a Hadamard gate acting on a single qubit is a basic building block for interference generation and realizes one bit of interference, an ``ibit.'' We use the interference measure to quantify interference for various examples, including Grover's search algorithm and Shor's factorization algorithm. We distinguish between ``potentially available'' and ``actually used'' interference, and show that for both algorithms the potentially available interference is exponentially large. However, the amount of interference actually used in Grover's algorithm is only about $3\phantom{\rule{0.3em}{0ex}}\mathrm{ibits}$ and asymptotically independent of the number of qubits, while Shor's algorithm indeed uses an exponential amount of interference.

arXiv:quant-ph/0510159•Physical Review A•Feb 7, 2006•33 citations

INTERFERENCE

Princeton University Press eBooks•May 14, 2024•0 citations

Non-Interference Patterns Evolving to Interference Patterns in Classical Wave Experiments

Peng, Hui

We experimentally show a universal phenomenon that, within macroscopic distances from diaphragm, patterns are non-interference and gradually evolve to the interferent patterns near the screen in the same wave experiment. Challenge is to consistently interpret, in the same classical wave experiment, the non-interference patterns, the interference patterns, and the non-interference patterns evolving to the interference patterns.

•Aug 13, 2023•0 citations

Interference

Klaus Lüders, R. O. Pohl

Springer eBooks•Jan 1, 2018•1 citation

Geometrical Characteristics of the Interference Between Two Monochromatic Point-Wave Sources

dong ZHANG

We study the geometry of interference between two monochromatic point-wave sources. Starting from two fixed sources A and B, the expanding circular wavefronts generate interference points determined by their path differences. For a fixed path difference nλ/2, these points form interference hyperbolas with A and B as their foci, while zero path difference gives the perpendicular bisector of AB. At each interference point, I, the three points A, B, and I form an interference triangle. Combining the interference condition ∣AI-BI∣=nλ/2with the triangle inequality gives n<AB/(λ/2), and therefore a finite number of interference hyperbolas for fixed source separation and wavelength. The construction also shows the before, at, and after stages of an interference point, the asymptotic behavior of the interference hyperbolas, and the accumulation of interference points generated by successive wavefronts. These characteristics follow from the geometry of two monochromatic point-wave sources alone.

•Sep 11, 2026•0 citations
We introduce an interference measure which allows to quantify the amount of interference present in any physical process that maps an initial density matrix to a final density matrix. In particular, the interference measure enables one to monitor the amount of interference generated in each step of a quantum algorithm. We show that a Hadamard gate acting on a single qubit is a basic building block for interference generation and realizes one bit of interference, an ``ibit.'' We use the interference measure to quantify interference for various examples, including Grover's search algorithm and Shor's factorization algorithm. We distinguish between ``potentially available'' and ``actually used'' interference, and show that for both algorithms the potentially available interference is exponentially large. However, the amount of interference actually used in Grover's algorithm is only about 3ibits3\phantom{\rule{0.3em}{0ex}}\mathrm{ibits}3ibits and asymptotically independent of the number of qubits, while Shor's algorithm indeed uses an exponential amount of interference.
We study the geometry of interference between two monochromatic point-wave sources. Starting from two fixed sources A and B, the expanding circular wavefronts generate interference points determined by their path differences. For a fixed path difference nλ/2, these points form interference hyperbolas with A and B as their foci, while zero path difference gives the perpendicular bisector of AB. At each interference point, I, the three points A, B, and I form an interference triangle. Combining the interference condition ∣AI-BI∣=nλ/2with the triangle inequality gives n<AB/(λ/2), and therefore a finite number of interference hyperbolas for fixed source separation and wavelength. The construction also shows the before, at, and after stages of an interference point, the asymptotic behavior of the interference hyperbolas, and the accumulation of interference points generated by successive wavefronts. These characteristics follow from the geometry of two monochromatic point-wave sources alone.