Abstract. We define and construct efficient depth-universal and almostsize-universal quantum circuits. Such circuits can be viewed as generalpurpose simulators for central classes ...
Debajyoti Bera, Stephen A. Fenner, Frederic Green,...
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...