Related papers: Single-shot GHZ characterization with connectivity…
Fault tolerant on-chip photonic quantum computation is enormously helped by (a) deterministic generation of the needed thousands to millions of photon qubits from (b) quantum emitters in designed spatially ordered arrays to enable networks…
We consider a model of two interacting always-on, exchange-only qubits for which controlled phase ($CPHASE$), controlled NOT ($CNOT$), quantum Fourier transform ($QFT$) and $SWAP$ operations can be implemented only in a few electrical…
Native multiqubit gates could be essential for bridging the gap from current noisy devices to future utility-scale quantum computers, as they can substantially reduce circuit depth for near-term applications on noisy devices and may also…
Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. The shallowest circuit depth needed to prepare Slater…
Proposals for large-scale semiconductor spin-based quantum computers require high-fidelity single-shot qubit readout to perform error correction and read out qubit registers at the end of a computation. However, as devices scale to larger…
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…
High-fidelity quantum gates are a cornerstone of any quantum computing and communications architecture. Realizing such control in the presence of realistic errors at the level required for beyond-threshold quantum error correction is a…
The realization of strong photon-photon interactions has presented an enduring challenge across photonics, particularly in quantum computing, where two-photon gates form essential components for scalable quantum information processing…
We show that the quantum parity gate on $n > 3$ qubits cannot be cleanly simulated by a quantum circuit with two layers of arbitrary C-SIGN gates of any arity and arbitrary 1-qubit unitary gates, regardless of the number of allowed ancilla…
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to…
CNOT optimization plays a significant role in noise reduction for Quantum Circuits. Several heuristic and exact approaches exist for CNOT optimization. In this paper, we investigate more complicated variations of optimal synthesis by…
Three-qubit gates are highly beneficial operations in quantum computing, enabling compact implementations of quantum algorithms and efficient generation of multipartite entangled states. However, realizing such gates with high fidelity…
We derive a set of composite pulse sequences that generates CNOT gates and correct all systematic errors within the logical subspace to arbitrary order. These sequences are applicable for any two-qubit interaction Hamiltonian, and make no…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
Using geometric phases to realize noise-resilient quantum computing is an important method to enhance the control fidelity. In this work, we experimentally realize a universal nonadiabatic geometric quantum gate set in a superconducting…
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by non-unitary, dynamic circuits.…
Dicke states serve as a critical resource in quantum metrology, communication, and computation. However, unitary preparation of Dicke states is limited to logarithmic depth in standard circuit models and existing constant-depth protocols…
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…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as…
This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit…