ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES

DOI10.1142/S0219749913500019MaRDI QIDQ5300680zbMATH OpenFDO

Authors Matthew McKague

Publication date 27 June 2013

Published in International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

complexity theoryinteractive proofs

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well know that a quantum circuit over the complex numbers can be transformed into a quantum circuit over the real numbers with the addition of a single qubit. This implies that BQP retains its power when restricted to using states and operations over the reals. We show that the same is true for QMA(k), QIP(k), QMIP, and QSZK.

Recommendations

• The power of various real-valued quantum queries
• On the Power of Quantum Computation
• On the Power of Quantum Algorithms for Vector Valued Mean Computation
• Quantum computation and real multiplication
• Determinism and computational power of real measurement-based quantum computation
• On the computational power of bounded error quantum Turing machines
• Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
• scientific article; zbMATH DE number 1839432
• Power of quantum computation with few clean qubits
• Universal quantum computation on the power of quantum non-demolition measurements

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Computational Complexity
• Generalized self-testing and the security of the 6-state protocol
• Quantum multi-prover interactive proof systems with limited prior entanglement.

Cited in

(6)

• Y-calculus: a language for real matrices derived from the ZX-calculus
• Determinism and computational power of real measurement-based quantum computation
• Quantum simulation from the bottom up: the case of rebits
• On the Power of Quantum Algorithms for Vector Valued Mean Computation
• The power of various real-valued quantum queries
• Why it is sufficient to have real-valued amplitudes in quantum computing

This page was built for publication: ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES

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