Controlled gate networks reduce two-qubit gate counts for linear combinations of unitary operators in quantum circuits, shown in variational calculations, rodeo eigenvalue estimation, and lattice nucleon evolution on real hardware.
Quantum Algorithms Revisited
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
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 multi-particle 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.
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Controlled Gate Networks: Theory and Application to Eigenvalue Estimation
Controlled gate networks reduce two-qubit gate counts for linear combinations of unitary operators in quantum circuits, shown in variational calculations, rodeo eigenvalue estimation, and lattice nucleon evolution on real hardware.
- Quantum simulating multi-particle processes in high energy nuclear physics: dijet production and color (de)coherence