Related papers: Minimal Equational Theories for Quantum Circuits
Equivalence checking of quantum circuits is an essential element in quantum program compilation, in which a quantum program can be synthesized into different quantum circuits that may vary in the number of qubits, initialization…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical…
Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we…
Quantum mechanics is based on a series of postulates which lead to a very good description of the microphysical realm but which have, up to now, not been derived from first principles. In the present work, we suggest such a derivation in…
This paper presents an elementary introduction to Consistent Quantum Theory (CQT), as developed by Griffiths and others over the past 25 years. The theory is a version of orthodox(Copenhagen) quantum mechanics, based on the notion that the…
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum…
Despite the rapid development of quantum computing these years, state-of-the-art quantum devices still contain only a very limited number of qubits. One possible way to execute more realistic algorithms in near-term quantum devices is to…
We provide a reformulation of finite dimensional quantum theory in the circuit framework in terms of mathematical axioms, and a reconstruction of quantum theory from operational postulates. The mathematical axioms for quantum theory are the…
Quantum theory can be derived from purely informational principles. Five elementary axioms-causality, perfect distinguishability, ideal compression, local distinguishability, and pure conditioning-define a broad class of theories of…
Constructing general programmable circuits to be able to run any given unitary operator efficiently on a quantum processor is of fundamental importance. We present a new quantum circuit design technique resulting two general programmable…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
We present a theory of quantum circuits based on logical qubits encoded in chirality of electron spin complexes in lateral gated semiconductor triple quantum dot molecules with one electron spin in each dot. Using microscopic Hamiltonian we…
The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A…
The physics of a quantum system with many degrees of freedom is often approximated by downfolding: most of the degrees of freedom are "folded into" a much smaller number of degrees of freedom, resulting in an effective Hamiltonian that…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when…
This paper gives a thorough critique of the foundations of quantum physics in its mainstream interpretation (i.e., treating pure states as primitives, without reference to hidden variables, and without modifications of the quantum laws).…
When modeling the effects of noise on quantum circuits, one often makes the assumption that these effects can be accounted for by individual decoherence events following an otherwise noise-free gate. In this work, we address the validity of…
We construct reversible Boolean circuits efficiently simulating reversible Turing machines. Both the circuits and the simulation proof are rather simple. Then we give a fairly straightforward generalization of the circuits and the…