Exact and efficient simulation of concordant computation

DOI10.1088/1367-2630/17/11/113049zbMath1452.81076arXiv1507.07196OpenAlexW2241575541WikidataQ59441478 ScholiaQ59441478MaRDI QIDQ5144311

Daniel E. Browne, Hugo Cable

Publication date: 15 January 2021

Published in: New Journal of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.07196

zbMATH Keywords

quantum algorithmsquantum computingquantum discord

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum gates (81P65)

Related Items (1)

Extrapolated quantum states, void states and a huge novel class of distillable entangled states

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical, quantum and total correlations
• Advanced Linear Algebra
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Parts of quantum states
• On the role of entanglement in quantum-computational speed-up
• Quantum Discord: A Measure of the Quantumness of Correlations
• Necessary and Sufficient Condition for Nonzero Quantum Discord
• Negative quasi-probability as a resource for quantum computation

This page was built for publication: Exact and efficient simulation of concordant computation