Quantum algorithms: entanglement–enhanced information processing
From MaRDI portal
Publication:3598151
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.
Recommendations
- Quantum entanglement and encoding algorithm
- scientific article; zbMATH DE number 1542869
- scientific article; zbMATH DE number 1418480
- scientific article; zbMATH DE number 1839431
- Quantum Algorithms
- Quantum algorithms
- Quantum algorithmic entropy
- Quantum information processing. Theory and implementation
- Quantum–enhanced information processing
- Quantum algorithmic complexities and entropy
Cited in
(35)- Quantum Bell nonlocality cannot be shared under a special kind of bilateral measurements for high-dimensional quantum states
- Eliminating the Unruh effect of relativistic Dirac fields by partial measurements
- Construction of a family of positive but not completely positive map for the detection of bound entangled states
- Quantum–enhanced information processing
- 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
- Entanglement and its role in Shor's algorithm
- Quantum fast Fourier transform using multilevel atoms
- 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
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Sudden death of entanglement in fermionic systems under collective decoherence
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- Quantum computing algorithm for electromagnetic field simulation
- Upper bounds of holographic entanglement entropy growth rate for thermofield double states
- Superfast Fourier transform using QTT approximation
- 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
- 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
- Entanglement in phase estimation algorithm and quantum counting algorithm
- 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
- The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics
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)
