Quantum algorithms: entanglement–enhanced information processing

DOI10.1098/rsta.1998.0248zbMath1152.81837arXivquant-ph/9803072OpenAlexW2957136701MaRDI QIDQ3598151

Artur Ekert, Richard Jozsa

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)

Full work available at URL: https://arxiv.org/abs/quant-ph/9803072

Mathematics Subject Classification ID

Related Items (27)

Atom-photon entanglement beyond the multi-photon resonance condition ⋮ Geometric algebra and information geometry for quantum computational software ⋮ Quantum entanglement and the Bell matrix ⋮ Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems ⋮ Quantum computing without entanglement ⋮ Eliminating the Unruh effect of relativistic Dirac fields by partial measurements ⋮ Synthesis of Deutsch-Jozsa circuits and verification by IBM Q ⋮ Quantum Bell nonlocality cannot be shared under a special kind of bilateral measurements for high-dimensional quantum states ⋮ Upper bounds of holographic entanglement entropy growth rate for thermofield double states ⋮ QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images ⋮ 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 rhythm of quantum algorithms ⋮ Unnamed Item ⋮ The quadratic speedup in Grover's search algorithm from the entanglement perspective ⋮ Quantum correlations as precursors of entanglement ⋮ Superfast Fourier transform using QTT approximation ⋮ The Deutsch-Jozsa problem: de-quantisation and entanglement ⋮ A bonding model of entanglement for N-qubit graph states ⋮ Quantum computing algorithm for electromagnetic field simulation ⋮ Superfast solution of linear convolutional Volterra equations using QTT approximation ⋮ A relational time-symmetric framework for analyzing the quantum computational speedup ⋮ Witnessing entanglement by proxy ⋮ 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 ⋮ Sudden death of entanglement in fermionic systems under collective decoherence ⋮ Quantum probabilistic teleportation via entangled coherent states

This page was built for publication: Quantum algorithms: entanglement–enhanced information processing