Add to ORKGAbstract. The present paper formulates a language for quantum computation and information. This language makes it possible to write equivalent formulas for all combinational quantum circuits including the Grover search circuit. It is recursively axiomatised. The axiomatization is complete and decidable. Algorithms for uniform translation of quantum circuits into formulas in the language are sketched and some complexity results are demonstrated. Keywords:Probability logic, quantum computing, quantum circuits, complexity.
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called ...
In this work we advance a generalization of quantum computational logics capable of dealing with som...
The agenda of quantum algorithmic information theory, ordered `top-down, is the quantum halting ampl...
This book provides a general survey of the main concepts, questions and results that have been devel...
This book provides a general survey of the main concepts, questions and results that have been devel...
In the first chapter we introduce new forms of quantum logic suggested by quantum computation, calle...
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called ...
22 Quantum computational logics are special examples of quantum logic where formulas are supposed t...
The study of computational processes based on the laws of quantum mechanics has led to the discovery...
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic c...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
We present a logical calculus for reasoning about information flow in quan-tum programs. In particul...
The goal of the presented paper is to provide an introduction to the basic computational models used...
In quantum computational logics meanings of formulas are identified with quantum information quantit...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called ...
In this work we advance a generalization of quantum computational logics capable of dealing with som...
The agenda of quantum algorithmic information theory, ordered `top-down, is the quantum halting ampl...
This book provides a general survey of the main concepts, questions and results that have been devel...
This book provides a general survey of the main concepts, questions and results that have been devel...
In the first chapter we introduce new forms of quantum logic suggested by quantum computation, calle...
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called ...
22 Quantum computational logics are special examples of quantum logic where formulas are supposed t...
The study of computational processes based on the laws of quantum mechanics has led to the discovery...
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic c...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
We present a logical calculus for reasoning about information flow in quan-tum programs. In particul...
The goal of the presented paper is to provide an introduction to the basic computational models used...
In quantum computational logics meanings of formulas are identified with quantum information quantit...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called ...
In this work we advance a generalization of quantum computational logics capable of dealing with som...
The agenda of quantum algorithmic information theory, ordered `top-down, is the quantum halting ampl...