Non-adaptive measurement-based quantum computation and multi-party Bell inequalities

DOI10.1088/1367-2630/13/2/023014zbMath1448.81107arXiv1009.5213OpenAlexW3098447255WikidataQ62382455 ScholiaQ62382455MaRDI QIDQ5135808

Matty J. Hoban, Klearchos Loukopoulos, Earl T. Campbell, Dan E. Browne

Publication date: 24 November 2020

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

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

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Entanglement measures, concurrencies, separability criteria (81P42)

Related Items (4)

Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ Hierarchies of resources for measurement-based quantum computation ⋮ Multicharacters remote rotation sharing with five-particle cluster state ⋮ Power of uninitialized qubits in shallow quantum circuits

Cites Work

• Bell’s Inequalities and Quantum Communication Complexity
• Bell’s Theorem for GeneralN-Qubit States
• Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Extreme quantum entanglement in a superposition of macroscopically distinct states
• A glance beyond the quantum model
• Proposed Experiment to Test Local Hidden-Variable Theories

This page was built for publication: Non-adaptive measurement-based quantum computation and multi-party Bell inequalities