Related papers: Resource-Optimized Fermionic Local-Hamiltonian Sim…
Variational quantum eigensolver (VQE) for electronic structure calculations is believed to be one major potential application of near term quantum computing. Among all proposed VQE algorithms, the unitary coupled cluster singles and doubles…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
Near-term quantum computations are limited by high error rates, the scarcity of qubits and low qubit connectivity. Increasing support for mid-circuit measurements and qubit reset in near-term quantum computers enables qubit reuse that may…
Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum…
In variational quantum algorithms, parameterization is typically applied to single-qubit gates.In this study, we instead parameterize a generalized controlled gate and propose an algorithm to locally minimize the cost function by maximally…
Quantum computing is moving beyond its early stage and seeking for commercial applications in chemical and biomedical sciences. In the current noisy intermediate-scale quantum computing era, quantum resource is too scarce to support these…
Variational quantum algorithms on bosonic quantum processors are an emerging paradigm for quantum chemistry calculations, exploiting the natural alignment between molecular structure and harmonic oscillator-based hardware. We introduce the…
Quantum computers are emerging as a promising new technology due to their ability to solve complex problems that exceed the capabilities of classical systems in terms of time. Among various implementations, superconducting qubits have…
The Variational Quantum Eigensolver (VQE) is one the most perspective algorithms for simulation of quantum many body physics that have recently attached a lot of attention and believed would be practical for implementation on the near term…
The study of spontaneous supersymmetry breaking (SSB) on the lattice is obstructed by a severe sign problem. Quantum computing provides a promising alternative approach. In particular, properties of supersymmetry relate SSB to the…
Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
Recently, the development of quantum chips has made great progress-- the number of qubits is increasing and the fidelity is getting higher. However, qubits of these chips are not always fully connected, which sets additional barriers for…
The development of quantum algorithms to solve quantum chemistry problems has offered a promising new paradigm of performing computer simulations at the scale of atoms and molecules. Although majority of the research so far has focused on…
In this paper, we demonstrate that optimal control algorithms can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases,…
While quantum algorithms for simulation exhibit better asymptotic scaling than their classical counterparts, they currently cannot be implemented on real-world devices. Instead, chemists and computer scientists rely on costly classical…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
Classical simulation of molecular systems is limited by exponential scaling, a hurdle quantum algorithms like Variational Quantum Eigensolvers (VQEs) aim to overcome. Although ADAPT-VQE enhances VQEs by dynamically building ans\"atze, it…
We consider a hybrid digital-analog quantum computing approach, which allows implementing any quantum algorithm without standard two-qubit gates. This approach is based on the always-on interaction between qubits, which can provide an…