Related papers: Decomposition Algorithm of an Arbitrary Pauli Expo…
While advances in quantum hardware occur in modest steps, simulators running on classical computers provide a valuable test bed for the construction of quantum algorithms. Given a unitary matrix that performs certain operation, obtaining…
Efficient quantum circuits are necessary for realizing quantum algorithms on noisy intermediate-scale quantum devices. Fermionic excitations entering unitary coupled-cluster (UCC) ans\"atze give rise to quantum circuits containing CNOT…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
An unknown unitary gates, which is secretly chosen from several known ones, can always be distinguished perfectly. In this paper, we implement such a task on IBM's quantum processor. More precisely, we experimentally demonstrate the…
We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known…
Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\log_2(3)$…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
Traditional quantum circuit optimization is performed directly at the circuit level. Alternatively, a quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus, after which a simplified…
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…
It is commonly believed that decoherence is the main obstacle to quantum information processing. In contrast to this, we show how decoherence in the form of dissipation can improve the performance of certain quantum gates. As an example we…
Introducing flexible native entanglement gates can significantly reduce circuit complexity. We propose a novel gate integrating iswap and cphase operations within a single gate cycle. We theoretically show one possible realization of this…
We design a deterministic subexponential time algorithm that takes as input a multivariate polynomial $f$ computed by a constant-depth circuit over rational numbers, and outputs a list $L$ of circuits (of unbounded depth and possibly with…
Circuit cutting, the partitioning of quantum circuits into smaller independent fragments, has become a promising avenue for scaling up current quantum-computing experiments. Here, we introduce a scheme for joint cutting of two-qubit…
The use of a few intermediate qutrits for efficient decomposition of 3-qubit unitary gates has been proposed, to obtain an exponential reduction in the depth of the decomposed circuit. An intermediate qutrit implies that a qubit is operated…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…