Related papers: Matchgate and space-bounded quantum computations a…
The composite rotation approach has been used to develop a range of robust quantum logic gates, including single qubit gates and two qubit gates, which are resistant to systematic errors in their implementation. Single qubit gates based on…
Parallel processing of information plays a critical role in accelerating computation. This includes quantum computers, where parallel processing of quantum information will play a critical role in practical quantum advantage. Here, we…
Boolean matching is an important problem in logic synthesis and verification. Despite being well-studied for conventional Boolean circuits, its treatment for reversible logic circuits remains largely, if not completely, missing. This work…
It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently…
Unitary gates with high entangling capabilities are relevant for several quantum-enhanced technologies. For symmetric multiqubit systems, such as spin states or bosonic systems, the particle exchange symmetry restricts these gates and also…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
Quantum compiling addresses the problem of approximating an arbitrary quantum gate with a string of gates drawn from a particular finite set. It has been shown that this is possible for almost all choices of base sets and furthermore that…
I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear…
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…
Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible…
Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches scale exponentially with the number of qubits or the circuit…
In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be…
Quantum formulas, defined by Yao [FOCS '93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once quantum formula over a gate set that contains all…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
It is shown that certain natural quantum logic gates, {\it i.e.} unitary time evolution matrices for spin-\frac{1}{2} quantum spins, can be represented as sums, with appropriate phases, over classical logic gates, in a direct analogy with…
We consider the model of quantum computer, which is represented as a Ising spin lattice, where qubits (spin-half systems) are separated by the isolators (two spin-half systems). In the idle mode or at the single bit operations the total…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be…