Related papers: Logarithmic Depth Decomposition of Approximate Mul…

We exhibit some simple gadgets useful in designing shallow parallel circuits for quantum algorithms. We prove that any quantum circuit composed entirely of controlled-not gates or of diagonal gates can be parallelized to logarithmic depth,…

We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and spacetime allocation (a…

A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit…

We present a method to enact a deterministic, measurement-free, optically generated controlled-phase gate on two qubits defined by single electrons trapped in large-area quantum dots in a planar microcavity. This method is robust to optical…

Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric…

Quantum state preparation is an important subroutine for quantum computing. We show that any $n$-qubit quantum state can be prepared with a $\Theta(n)$-depth circuit using only single- and two-qubit gates, although with a cost of an…

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…

This paper proposes a new optimized quantum block-ZXZ decomposition method [7,8,10] that results in more optimal quantum circuits than the quantum Shannon decomposition (QSD)[27], which was introduced in 2006 by Shende et al. The…

An efficient implementation of the Toffoli gate is of conceptual importance for running various quantum algorithms, including Grover's search and Shor's integer factorization. However, direct implementation of the Toffoli gate either…

Noise is both ubiquitous and generally deleterious in settings where precision is required. This is especially true in the quantum technology sector where system utility typically decays rapidly under its influence. Understanding the noise…

We present the first computationally-efficient algorithm for average-case learning of shallow quantum circuits with many-qubit gates. Specifically, we provide a quasi-polynomial time and sample complexity algorithm for learning unknown…

We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…

In this work, we introduce a general n-qubit formulation of control objectives that allows a control target to be specified in a diagonal frame, so that only the diagonal entries must be characterized, thus quadratically reducing the…

In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…

The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…

We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…

We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and…

We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…

Quantum circuit transformation (QCT, a.k.a. qubit mapping) is a critical step in quantum circuit compilation. Typically, QCT is achieved by finding an appropriate initial mapping and using SWAP gates to route the qubits such that all…

Realizing non-unitary transformations on unitary-gate based quantum devices is critically important for simulating a variety of physical problems including open quantum systems and subnormalized quantum states. We present a dilation based…