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

DOI10.1007/S11128-016-1324-XzbMATH Open1348.81158DBLPjournals/qip/BatleOFAA16aOpenAlexW2343599839WikidataQ62554335 ScholiaQ62554335MaRDI QIDQ331871FDOQ331871

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization by Simulated Annealing
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Proposed Experiment to Test Local Hidden-Variable Theories
• Bell inequality, Bell states and maximally entangled states for \(n\) qubits
• Global versus local quantum correlations in the Grover search algorithm
• Information and computation: Classical and quantum aspects
• Nonlocality and entanglement in qubit systems
• Nonlocality of cluster states of qubits
• Quantum algorithms revisited
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Introduction to Quantum Computation and Information
• Searching for highly entangled multi-qubit states
• Rapid solution of problems by quantum computation
• Quantum stochastic optimization
• A characterization of global entanglement
• ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
• Bell inequalities and the separability criterion

Cited In (4)

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

Recommendations

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

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)