A Logic for Quantum Circuits and Protocols

Autor:	Manas K. Patra
Rok vydání:	2005
Předmět:	Quantum network Theoretical computer science Quantum Turing machine Computer science Quantum convolutional code Quantum algorithm Quantum information Unitary state Algorithm Quantum Hardware_LOGICDESIGN Quantum complexity theory Quantum computer
Zdroj:	Theoretical Aspects of Computing – ICTAC 2005 ISBN: 9783540291077 ICTAC
DOI:	10.1007/11560647_28
Popis:	A logic for reasoning about quantum circuits and protocols is proposed. It incorporates the basic features of quantum theory-probability, unitary dynamics, tensor products and measurement. The underlying language could be used for verification and synthesis of quantum circuits. Important algorithms like the quantum search algorithm of Grover are discussed. The logic also forms the foundation on which more elaborate formal systems for reasoning about quantum protocols could be based. A sound and complete axiomatization is presented. Algorithms for circuit verification, circuit equivalence (exact and approximate) are outlined. Some related complexity issues are also discussed.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::167b84e854957f547062830ae091b525 https://doi.org/10.1007/11560647_28 Zobrazit plný text záznamu