Related papers: Efficient particle-conserving brick-wall quantum c…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
In the noisy intermediate-scale quantum (NISQ) era, two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates. Therefore, reducing the number of two-qubit gates is crucial for improving circuit efficiency and…
Variational quantum circuits build the foundation for various classes of quantum algorithms. In a nutshell, the weights of a parametrized quantum circuit are varied until the empirical sampling distribution of the circuit is sufficiently…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
The ability of quantum computers to overcome the exponential memory scaling of many-body problems is expected to transform quantum chemistry. Quantum algorithms require accurate representations of electronic states on a quantum device, but…
Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged…
Parameterized quantum circuits (PQCs) are pivotal components of variational quantum algorithms (VQAs), which represent a promising pathway to quantum advantage in noisy intermediate-scale quantum (NISQ) devices. PQCs enable flexible…
Shortening quantum circuits is crucial to reducing the destructive effect of environmental decoherence and enabling useful algorithms. Here, we demonstrate an improvement in such compilation tasks via a combination of using hybrid…
To achieve scalable quantum computing, improving entangling-gate fidelity and its implementation-efficiency are of utmost importance. We present here a linear method to construct provably power-optimal entangling gates on an arbitrary pair…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main obstacle is separating…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
Constrained problems are frequently encountered in classical and quantum optimization. Particle conservation, in particular, is commonly imposed when studying energy spectra of chemical and solid state systems. Though particle…
How to effectively construct robust quantum gates for time-varying noise is a very important but still outstanding problem. Here we develop a systematic method to find pulses for quantum gate operations robust against both low- and…
We present a tensor-network-based method for simulating a weakly-measured quantum circuit. In particular, we use a Markov chain to efficiently sample measurements and contract the tensor network, propagating their effect forward along the…
Quantum computers require precise control over parameters and careful engineering of the underlying physical system. In contrast, neural networks have evolved to tolerate imprecision and inhomogeneity. Here, using a reservoir computing…
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…
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…