Related papers: Stoquasticity in circuit QED
We analyze a coupling scheme for qubits in different cavities of circuit-QED architecture. In contrast to the usual scheme where the cavities are coupled by an interface capacitance we employ a bridge qubit connecting cavities to mediate…
We consider the adiabatic quantum algorithm for systems with "no sign problem", such as the transverse field Ising mode, and analyze the equilibration time for quantum Monte Carlo (QMC) on these systems. We ask: if the spectral gap is only…
As a qubit usually has a limited lifetime, its manipulation should be as fast as possible, and thus non-adiabatic operation is more preferable. Moreover, as a qubit inevitably interacts with its surrounding environment, robust operations…
Open classical and quantum systems with effective parity-time ($\mathcal{PT}$) symmetry, over the past five years, have shown tremendous promise for advances in lasers, sensing, and non-reciprocal devices. And yet, how such effective…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
All known examples confirming the possibility of an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (AQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric…
We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…
Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further understanding of essential features in such systems. Quantum Monte Carlo…
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
In this paper, we aim to broaden the spectrum of possible applications of quantum computers and use their capabilities to investigate effects in cavity quantum electrodynamics ("cavity QED"). Interesting application examples are material…
We construct quantum circuits which exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced "qubitization" framework, one can use…
The viability of non-stoquastic catalyst Hamiltonians to deliver consistent quantum speedups in quantum adiabatic optimization remains an open question. The infinite-range ferromagnetic $p$-spin model is a rare example exhibiting an…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
It is shown that a class of separately frustration-free (SFF) Hamiltonians can be Monte Carlo simulated efficiently on a classical computing machine, because such an SFF Hamiltonian corresponds to a Gibbs wavefunction whose nodal structure…
We consider a circuit-QED setup that allows the induction and control of non-Markovian dynamics of a qubit. Non-Markovianity is enforced over the qubit by means of its direct coupling to a bosonic mode which is controllably coupled to other…
Quantum algorithms are of great interest for their possible use in optimization problems. In particular, variational algorithms that use classical counterparts to optimize parameters hold promise for use in currently existing devices.…
We introduce a Quantum Monte Carlo (QMC) method which efficiently simulates in a sign-problem-free way a broad class of frustrated $S=1/2$ models with competing antiferromagnetic interactions. Our scheme uses the basis of total spin…
Light-matter coupled Hamiltonians are central to cavity materials engineering and polaritonic chemistry, but are challenging to simulate with classical hardware due to the scaling of the Hilbert space with the number of quantum photon modes…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…