939 search results - page 7 / 188 » Semantic Abstraction and Quantum Computation |
165
click to vote
ASIAN
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
101
click to vote
CORR
2004
Springer
14 years 9 months ago
2004
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...