Related papers: Improved simulation of quantum circuits dominated …
Compiling shallow and accurate quantum circuits for Hamiltonian simulation remains challenging due to hardware constraints and the combinatorial complexity of minimizing gate count and circuit depth. Existing optimization method pipelines…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized…
We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation…
The last few years have seen rapid development of applications of quantum computation to quantum field theory. The first algorithms for quantum simulation of scattering have been proposed in the context of scalar and fermionic theories,…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
Until high-fidelity quantum computers with a large number of qubits become widely available, classical simulation remains a vital tool for algorithm design, tuning, and validation. We present a simulator for the Quantum Approximate…
Quantum Phase Estimation (QPE) is a cornerstone algorithm for fault-tolerant quantum computation, especially for electronic structure calculations of chemical systems. To accommodate the diverse characteristics of quantum chemical systems,…
Gate set tomography (GST) is a self-consistent and highly accurate method for the tomographic reconstruction of a quantum information processor's quantum logic operations, including gates, state preparations, and measurements. However,…
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that…
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of…
The fermionic quantum emulator (FQE) is a collection of protocols for emulating quantum dynamics of fermions efficiently taking advantage of common symmetries present in chemical, materials, and condensed-matter systems. The library is…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection…
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit…
An explicit algorithm for calculating the optimized Euler angles for both qubit state transfer and gate engineering given two arbitary fixed Hamiltonians is presented. It is shown how the algorithm enables us to efficiently implement single…
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number…
We show that the cost of strong simulation of quantum circuits using $t$ $T$ gate magic states exhibits non-trivial reductions on its upper bound for $t=1$, $t=2$, $t=3$, and $t=6$ with odd-prime-qudits. This agrees with previous numerical…
The Quantum Skip Gate (QSG) is a unitary circuit primitive that coherently superposes the execution and omission of an expensive quantum subroutine based on the outcome of a cheaper preceding subroutine, without mid-circuit measurement or…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…