Space-efficient 1. 5-way quantum Turing machine

DOI10.1007/3-540-44669-9_37MaRDI QIDQ4782728zbMATH OpenFDO

Authors Andrej Dubrovsky

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380380

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Time-space efficient simulations of quantum computations
• Space-bounded quantum complexity
• scientific article; zbMATH DE number 6820203
• Efficient circuits for exact-universal computation with qudits
• Quantum Turing automata
• Quantum computing: 1-way quantum automata
• On the complexity of simulating space-bounded quantum computations
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
• Efficient discrete approximations of quantum gates
• Dense quantum coding and a lower bound for 1-way quantum automata

This page was built for publication: Space-efficient 1. 5-way quantum Turing machine

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