Related papers: Accurate and precise quantum computation of valenc…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
We analyze the operation of quantum gates for neutral atoms with qubits that are delocalized in space, i.e., the computational basis states are defined by the presence of a neutral atom in the ground state of one out of two trapping…
A robust system for use of Quantum Computation using neutral atoms is presented in this communication. This scheme exploits a multilevel atomic system interacting with two lasers in such a way that it leads to formation of two Coherent…
Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. As a novel approach, quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the…
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…
The author analyzes quantum computation with the hybrid qubit (HQ) that is encoded using the three-electron configuration of a double quantum dot. All gate operations are controlled with electric signals, while the qubit remains at an…
Holonomic quantum computation is a quantum computation strategy that promises some built-in noise-resilience features. Here, we propose a scheme for nonadiabatic holonomic quantum computation with nitrogen-vacancy center electron spins,…
Solving ground states of quantum many-body systems has been a long-standing problem in condensed matter physics. Here, we propose a new unsupervised machine learning algorithm to find the ground state of a general quantum many-body system…
Quantum computing offers a potential for algorithmic speedups for applications, such as large-scale simulations in chemistry and physics. However, these speedups must yield results that are sufficiently accurate to predict realistic…
We conduct experimental simulations of many body quantum systems using a \emph{hybrid} classical-quantum algorithm. In our setup, the wave function of the transverse field quantum Ising model is represented by a restricted Boltzmann…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or number of repetitions in error corrected and noisy intermediate scale quantum (NISQ) algorithms for chemistry. We report a…
Neutral-atom arrays are a leading platform for quantum technologies, offering a promising route toward large-scale, fault-tolerant quantum computing. We propose a novel quantum processing architecture based on dual-type, dual-element atom…
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes,…
Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems. In this work, we propose a simple method to design exact linear-depth parameterized quantum circuits…
Error mitigation (EM) methods are crucial for obtaining reliable results in the realm of noisy intermediate-scale quantum (NISQ) computers, where noise significantly impacts output accuracy. Some EM protocols are particularly efficient for…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
Quantum computing offers a scalable approach to solving the nuclear shell model, a highly complex and exponentially scaled many-body problem. This work presents a numerical simulation of the subspace search variational quantum eigensolver…
Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical…
We propose an effective realization of a complete set of elementary quantum gates in the solid-state quantum computer based on the multi-atomic coherent (MAC-) ensembles in the QED cavity. Here, we use the two-ensemble qubit encoding and…