Automated Method for Building CNOT Based Quantum Circuits for Boolean Functions

Simple item page
dc.creatorYounes, Ahmed
dc.creatorMiller, Julian
dc.date2003-04-14
dc.date.accessioned2026-07-07T09:54:50Z
dc.date.available2026-07-07T09:54:50Z
dc.descriptionIn this paper we discuss an efficient technique that can implement any given Boolean function as a quantum circuit. The method converts a truth table of a Boolean function to the corresponding quantum circuit using a minimal number of auxiliary qubits. We give examples of some circuits synthesized with this technique. A direct result that follows from the technique is a new way to convert any classical digital circuit to its classical reversible form.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0304099
dc.identifierhttp://arxiv.org/abs/quant-ph/0304099
dc.identifierIn Proceeding of ICENCO2004 pp. 562- 565 (2004).
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166466
dc.subjectQuantum Physics
dc.titleAutomated Method for Building CNOT Based Quantum Circuits for Boolean Functions
dc.typetext

Files

Collections

arXiv