scientific article; zbMATH DE number 6820203

DOI10.4230/LIPICS.ICALP.2016.14MaRDI QIDQ4598147zbMATH OpenFDO

Authors Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura

Publication date 19 December 2017

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

zbMATH Keywords

error reductionquantum computingquantum Merlin-Arthur proof systemsspace-bounded computation

Mathematics Subject Classification ID

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

Recommendations

• Unbounded-error quantum computation with small space bounds
• A method to reduce resources for quantum error correction
• Unitary application of the quantum error correction codes
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• An optimal quantum error-correcting procedure using quantifier elimination
• Eliminating intermediate measurements in space-bounded Quantum computation
• Space-bounded quantum complexity
• Efficient one-way quantum computations for quantum error correction
• Quantum error-avoiding code based on the decoherence-free subspace
• Quantum error-correcting codes: the unit design strategy

Cited in

(5)

• Power of quantum computation with few clean qubits
• scientific article; zbMATH DE number 1839460 (Why is no real title available?)
• A complete characterization of unitary quantum space
• Unbounded-error quantum computation with small space bounds
• Quantum logspace algorithm for powering matrices with bounded norm

This page was built for publication:

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