Related papers: A framework for exact synthesis
Multi-qubit entangling interactions arise naturally in several quantum computing platforms and promise advantages over traditional two-qubit gates. In particular, a fixed multi-qubit Ising-type interaction together with single-qubit X-gates…
Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a $2.5$ times reduction in expected $T$-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to…
Quantum algorithms for quantum chemistry map the dynamics of electrons in a molecule to the dynamics of a coupled spin system. To reach chemical accuracy for interesting molecules, a large number of quantum gates must be applied which…
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the…
A quantum computer consists of a set of quantum bits upon which operations called gates are applied to perform computations. In order to perform quantum algorithms, physicists would like to design arbitrary gates to apply to quantum bits.…
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…
We study ancilla-free approximation of single-qubit unitaries $U\in {\rm SU}(2)$ by gate sequences over Clifford+$G$, where $G\in\{T,V\}$ or their generalization. Let $p$ denote the characteristic factor of the gate set (e.g., $p=2$ for…
The problem of finding a constant bound on a term given a set of assumptions has wide applications in optimization as well as program analysis. However, in many contexts the objective term may be unbounded. Still, some sort of symbolic…
Compilation of unitaries into a sequence of physical quantum gates is a critical prerequisite for execution of quantum algorithms. This work introduces STOQ, a stochastic search protocol for approximate unitary compilation into a sequence…
Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…
Program synthesis is the process of automatically translating a specification into computer code. Traditional synthesis settings require a formal, precise specification. Motivated by computer education applications where a student learns to…
There is currently a significant need for robust and efficient methods for characterizing quantum devices. While there has been significant progress in this direction, there remains a crucial need to precisely determine the strength and…
We introduce a complete equational theory for the fragment of quantum circuits generated by the real Clifford gates plus the two-qubit controlled-Hadamard gate. That is, we give a simple set of equalities between circuits of this fragment,…
A quantum unitary gate is realized in this paper by perturbing a free charged particle in a one-dimensional box with a time- and position-varying electric field. The perturbed Hamiltonian is composed of a free particle Hamiltonian plus a…
When the gate set has continuous parameters, synthesizing a unitary operator as a quantum circuit is always possible using exact methods, but finding minimal circuits efficiently remains a challenging problem. The landscape is very…
What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an…
Quantum compiling, which aims to approximate target qubit gates by finding optimal sequences (braidwords) of basic braid operations, constitutes a fundamental challenge in quantum computing. We develop a genetic algorithm (GA)-enhanced…
Recent experimental progress in realizing surface code on hardware, including demonstrations of break-even logical memory on devices with up to hundreds of physical qubits, has materially advanced the prospects for fault-tolerant quantum…