Related papers: Random quantum circuits anti-concentrate in log de…
In the rapidly evolving field of quantum computing, optimizing quantum circuits for specific tasks is crucial for enhancing performance and efficiency. More recently, quantum sensing has become a distinct and rapidly growing branch of…
Quantum circuits must run on quantum computers with tight limits on qubit and gate counts. To generate circuits respecting both limits, a promising opportunity is exploiting uncomputation to trade qubits for gates. We present Reqomp, a…
A recurring challenge in quantum science and technology is the precise control of their underlying dynamics that lead to the desired quantum operations, often described by a set of quantum gates. These gates can be subject to…
The actual gate performed on, say, a qubit in a quantum computer may depend, not just on the actual laser pulses and voltages we programmed to implement the gate, but on its {\em context} as well. For example, it may depend on what gate has…
We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater…
Fault-tolerant quantum computing requires gates which function correctly despite the presence of errors, and are scalable if the error probability-per-gate is below a threshold value. To date, no method has been described for calculating…
Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The…
Random circuits giving rise to unitary designs are key tools in quantum information science and many-body physics. In this work, we investigate a class of random quantum circuits with a specific gate structure. Within this framework, we…
Important quantum algorithm routines allow the implementation of specific quantum operations (a.k.a. gates) by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit…
We search for efficient disentanglers on random Clifford circuits of two-qubit gates arranged in a brick-wall pattern, using the proximal policy optimization (PPO) algorithm \cite{schulman2017proximalpolicyoptimizationalgorithms}.…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
Bounding the cost of classically simulating the outcomes of universal quantum circuits to additive error $\delta$ is often called weak simulation and is a direct way to determine when they confer a quantum advantage. Weak simulation of the…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…
Multicritical Ising models and their perturbations are paradigmatic models of statistical mechanics. In two space-time dimensions, these models provide a fertile testbed for investigation of numerous non-perturbative problems in…
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…
Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high probability by any…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
Verification of quantum circuits is essential for guaranteeing correctness of quantum algorithms and/or quantum descriptions across various levels of abstraction. In this work, we show that there are promising ways to check the correctness…