The cost of quantum gate primitives

MaRDI QIDQ5439792zbMATH OpenFDO

Authors Soonchil Lee, Seong-Joo Lee, Taegon Kim, Jacob Biamonte, Marek A. Perkowski, Jae-Seung Lee

Publication date 11 February 2008

zbMATH Keywords

quantum algorithmsquantum computationquantum gate costquantum synthesis

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Design of gates for quantum computation: the NOT gate
• Maximum speed of quantum gate operation
• Quantum computation: a tutorial
• scientific article; zbMATH DE number 5608701
• scientific article; zbMATH DE number 1867388

Cited in

(9)

• Heuristic methods to use don't cares in automated design of reversible and quantum logic circuits
• On figures of merit in reversible and quantum logic designs
• Quantum random access stored-program machines
• Line ordering of reversible circuits for linear nearest neighbor realization
• scientific article; zbMATH DE number 5568624 (Why is no real title available?)
• Synthesis of quantum circuits for linear nearest neighbor architectures
• A dynamic programming approach to multi-objective logic synthesis of quantum circuits
• Self-correcting quantum teleportation protocol
• Efficient and scalable designs for ternary quantum reversible multiplexer and demultiplexer systems

This page was built for publication: The cost of quantum gate primitives

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