Related papers: Estimating the Jones polynomial for Ising anyons o…
Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation, for the computation of expectation values, as shown by small-scale…
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a…
A method to study strongly interacting quantum many-body systems at and away from criticality is proposed. The method is based on a MERA-like tensor network that can be efficiently and reliably contracted on a noisy quantum computer using a…
Hamiltonian moments in Fourier space - expectation values of the unitary evolution operator under a Hamiltonian at different times - provide a convenient framework to understand quantum systems. They offer insights into the energy…
This paper presents a novel framework for high-dimensional nonlinear quantum computation that exploits tensor products of amplified vector and matrix encodings to efficiently evaluate multivariate polynomials. The approach enables the…
Quantum phase estimation is the workhorse behind any quantum algorithm and a promising method for determining ground state energies of strongly correlated quantum systems. Low-cost quantum phase estimation techniques make use of circuits…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
Classical verification of quantum learning allows classical clients to reliably leverage quantum computing advantages by interacting with untrusted quantum servers. Yet, current quantum devices available in practice suffers from a variety…
We examine a stochastic noise process that has a decohering effect on the average evolution of qubits in the quantum register of the solid state quantum computer proposed by Kane. We consider the effects of this process on the single qubit…
This is an introduction to software methods of quantum fault tolerance. Broadly speaking, these methods describe strategies for using the noisy hardware components of a quantum computer to perform computations while continually monitoring…
State-of-the-art noisy digital quantum computers can only execute short-depth quantum circuits. Variational algorithms are a promising route to unlock the potential of noisy quantum computers since the depth of the corresponding circuits…
Quantum computing is an emerging technology that has the potential to achieve exponential speedups over their classical counterparts. To achieve quantum advantage, quantum principles are being applied to fields such as communications,…
Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently…
This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our…
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…
We present a robust shadow estimation protocol for wide classes of low-depth measurement circuits that mitigates noise as long as the effective measurement map including noise is locally unitarily invariant. This is in practice an excellent…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
Errors occurring on noisy hardware pose a key challenge to reliable quantum computing. Existing techniques such as error correction, mitigation, or suppression typically separate the error handling from the algorithm analysis and design. In…
We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy)…
Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various…