Quantum algorithms: entanglement–enhanced information processing
From MaRDI portal
Publication:3598151
DOI10.1098/RSTA.1998.0248zbMATH Open1152.81837arXivquant-ph/9803072OpenAlexW2957136701MaRDI QIDQ3598151FDOQ3598151
Publication date: 31 January 2009
Published in: Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Abstract: We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the principles underlying the fast Fourier transform algorithm. We describe the implementation of the FFT algorithm for the group of integers modulo 2^n in the quantum context, showing how the group-theoretic formalism leads to the standard quantum network and identifying the property of entanglement that gives rise to the exponential speedup (compared to the classical FFT). Finally we outline the use of the Fourier transform in extracting periodicities, which underlies its utility in the known quantum algorithms.
Full work available at URL: https://arxiv.org/abs/quant-ph/9803072
Cited In (31)
- Eliminating the Unruh effect of relativistic Dirac fields by partial measurements
- Quantum–enhanced information processing
- Construction of a family of positive but not completely positive map for the detection of bound entangled states
- Atom-photon entanglement beyond the multi-photon resonance condition
- Moments based entanglement criteria and measures
- Quantum computing without entanglement
- QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
- Geometric algebra and information geometry for quantum computational software
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Tighter parameterized monogamy relations
- Quantum correlations as precursors of entanglement
- Superfast solution of linear convolutional Volterra equations using QTT approximation
- Quantum entanglement and the Bell matrix
- Witnessing entanglement by proxy
- Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems
- Sudden death of entanglement in fermionic systems under collective decoherence
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Title not available (Why is that?)
- Upper bounds of holographic entanglement entropy growth rate for thermofield double states
- Quantum computing algorithm for electromagnetic field simulation
- Witness operator provides better estimate of the lower bound of concurrence of bipartite bound entangled states in \(d_1\otimes d_2\)-dimensional system
- Quantum simulation of Maxwell's equations via Schrödingerisation
- Superfast Fourier transform using QTT approximation
- Mermin polynomials for non-locality and entanglement detection in Grover's algorithm and quantum Fourier transform
- The rhythm of quantum algorithms
- Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Synthesis of Deutsch-Jozsa circuits and verification by IBM Q
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
- A bonding model of entanglement for N-qubit graph states
- Quantum probabilistic teleportation via entangled coherent states
- Quantum Bell nonlocality cannot be shared under a special kind of bilateral measurements for high-dimensional quantum states
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Quantum algorithmic entropy 👍 👎
- Quantum Algorithmic Complexities and Entropy 👍 👎
- Quantum Algorithms 👍 👎
- Quantum Information Processing 👍 👎
- Quantum–enhanced information processing 👍 👎
- Quantum entanglement and encoding algorithm 👍 👎
This page was built for publication: Quantum algorithms: entanglement–enhanced information processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598151)
