Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?

DOI10.1007/S11128-016-1324-XMaRDI QIDQ331871zbMATHOpenAlexDBLPWikidataFDO

Authors C. H. Raymond Ooi, Ahmed Farouk, J. Batle, M. Abutalib, S. Abdalla

Publication date 27 October 2016

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11128-016-1324-x

zbMATH Keywords

entanglementnon-localityquantum annealingquantum speedupmultipartite systemsadiabatic quantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40)

Recommendations

• Why adiabatic quantum annealing is unlikely to yield speed-up
• How quantum is the speedup in adiabatic unstructured search?
• How fast can quantum annealers count?
• Adiabatic shortcut and quantum correlation in composite system
• How fast and robust is the quantum adiabatic passage?
• On the role of entanglement in quantum-computational speed-up
• Entanglement properties of adiabatic quantum algorithms
• Quantum dynamical speedup for correlated initial states
• ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
• Quantum Correlations in Multipartite Quantum Systems

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3116475 (Why is no real title available?)
• scientific article; zbMATH DE number 5666687 (Why is no real title available?)
• scientific article; zbMATH DE number 1128569 (Why is no real title available?)
• scientific article; zbMATH DE number 1476921 (Why is no real title available?)
• A characterization of global entanglement
• Bell inequalities and the separability criterion
• Bell inequality, Bell states and maximally entangled states for \(n\) qubits
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Global versus local quantum correlations in the Grover search algorithm
• Information and computation: Classical and quantum aspects
• Introduction to Quantum Computation and Information
• Nonlocality and entanglement in qubit systems
• Nonlocality of cluster states of qubits
• Optimization by simulated annealing
• Proposed experiment to test local hidden-variable theories
• Quantum algorithms revisited
• Quantum stochastic optimization
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Rapid solution of problems by quantum computation
• Searching for highly entangled multi-qubit states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

Cited in

(5)

• How fast can quantum annealers count?
• The population inversion and the entropy of a moving two-level atom in interaction with a quantized field
• Entanglement properties of adiabatic quantum algorithms
• Quantum color image encryption algorithm based on a hyper-chaotic system and quantum Fourier transform
• Thermal entanglement in quantum annealing processor

This page was built for publication: Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331871)