Power of quantum computation with few clean qubits

DOI10.4230/LIPICS.ICALP.2016.13MaRDI QIDQ4598146zbMATH OpenFDO

Authors Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani

Publication date 19 December 2017

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

zbMATH Keywords

quantum computingerror reductioncomplete problemsDQC1

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Computing with highly mixed states
• Estimating Jones polynomials is a complete problem for one clean qubit
• scientific article; zbMATH DE number 6820203
• scientific article; zbMATH DE number 1335894
• Quantum Complexity Theory

Cited in

(8)

• Power of uninitialized qubits in shallow quantum circuits
• Quantum reservoir computing: a reservoir approach toward quantum machine learning on near-term quantum devices
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
• The Power of One Clean Qubit in Communication Complexity
• Computing with highly mixed states
• ON THE POWER QUANTUM COMPUTATION OVER REAL HILBERT SPACES
• The quantum complexity of computing Schatten p-norms
• scientific article; zbMATH DE number 7228448 (Why is no real title available?)

This page was built for publication: Power of quantum computation with few clean qubits

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