Related papers: Absence of censoring inequalities in random quantu…
Parallel computation enables multiple processors to execute different parts of a task simultaneously, improving processing speed and efficiency. In quantum computing, parallel gate implementation involves executing gates independently in…
Circuit optimization is a fundamental task for practical applications of near-term quantum computers. In this work we address this challenge through the powerful lenses of tensor network theory. Our approach involves the full…
To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both…
Atom chips are a promising candidate for a scalable architecture for quantum information processing provided a universal set of gates can be implemented with high fidelity. The difficult part in achieving universality is the entangling…
In near-term quantum computing devices, connectivity between qubits remain limited by architectural constraints. A computational circuit with given connectivity requirements necessary for multi-qubit gates have to be embedded within…
In this work, we prove that for any $m>1$, there exists a family of good qudit quantum codes supporting transversal logical $\mathsf{C}^{m-1}\mathsf{Z}$ gates that can address specified logical qudits and be largely executed in parallel.…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
Attributing performance gains in quantum machine learning to genuine quantum resources rather than to classical architectural scaling remains an open methodological challenge. We address this by introducing a counterfactual causal mediation…
We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 is the same (up to a constant factor) as in the standard…
Gate-model quantum computers provide an experimentally implementable architecture for near term quantum computations. To design a reduced quantum circuit that can simulate a high complexity reference quantum circuit, an optimization should…
Several interesting approaches have been reported in the literature on complex networks, random walks, and hierarchy of graphs. While many of these works perform random walks on stable, fixed networks, in the present work we address the…
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm…
The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…
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…
Variational Quantum Algorithms are one of the most promising candidates to yield the first industrially relevant quantum advantage. Being capable of arbitrary function approximation, they are often referred to as Quantum Neural Networks…
We introduce crosstalk-robust gate sets, which are obtained using a novel, scalable optimal control problem exploiting locality. Through the suppression of pairwise quantum crosstalk, the gate sets enable robustness that extends to…
Integrability is an exceptional property believed to hold only for systems with fine-tuned parameters. Contrary, we explicitly show that in homogeneous nearest-neighbor qubit circuits with a U(1) symmetry, i.e., circuits that repeatedly…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…