Quantum algorithms: entanglement–enhanced information processing
From MaRDI portal
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
(39)- Geometric algebra and information geometry for quantum computational software
- The rhythm of quantum algorithms
- Superfast Fourier transform using QTT approximation
- The Deutsch-Jozsa problem: de-quantisation and entanglement
- Quantum probabilistic teleportation via entangled coherent states
- Construction of a family of positive but not completely positive map for the detection of bound entangled states
- Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case
- Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems
- Entanglement in phase estimation algorithm and quantum counting algorithm
- Synthesis of Deutsch-Jozsa circuits and verification by IBM Q
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Superfast solution of linear convolutional Volterra equations using QTT approximation
- Atom-photon entanglement beyond the multi-photon resonance condition
- Upper bounds of holographic entanglement entropy growth rate for thermofield double states
- Witness operator provides better estimate of the lower bound of concurrence of bipartite bound entangled states in \(d_1\otimes d_2\)-dimensional system
- Mermin polynomials for non-locality and entanglement detection in Grover's algorithm and quantum Fourier transform
- The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics
- Quantum entanglement and the Bell matrix
- Entanglement and its role in Shor's algorithm
- QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images
- Quantum fast Fourier transform using multilevel atoms
- Quantum correlations as precursors of entanglement
- Quantum–enhanced information processing
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- A bonding model of entanglement for N-qubit graph states
- Witnessing entanglement by proxy
- Sudden death of entanglement in fermionic systems under collective decoherence
- Quantum computing without entanglement
- Eliminating the Unruh effect of relativistic Dirac fields by partial measurements
- Quantum Bell nonlocality cannot be shared under a special kind of bilateral measurements for high-dimensional quantum states
- Moments based entanglement criteria and measures
- Tighter parameterized monogamy relations
- The quadratic speedup in Grover's search algorithm from the entanglement perspective
- Quantum simulation of Maxwell's equations via Schrödingerisation
- On Schrödingerization-based quantum algorithms for linear dynamical systems with inhomogeneous terms
- Parameterized entanglement measures with computable lower bounds
- Quantum simulation of a class of highly-oscillatory transport equations via Schrödingerisation
- Analytical expression of the geometric quantum discord generated by asymmetric cloning
- Quantum computing algorithm for electromagnetic field simulation
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)
