Related papers: Quantum simulation and ground state preparation fo…
The Kitaev honeycomb model, which is exactly solvable by virtue of an extensive number of conserved quantities, supports a gapless quantum spin liquid phase as well as gapped descendants relevant for fault-tolerant quantum computation. We…
We explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We…
We propose a variational quantum algorithm to prepare ground states of 1D lattice quantum Hamiltonians specifically tailored for programmable quantum devices where interactions among qubits are mediated by Quantum Data Buses (QDB). For…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
We present a general computational framework to investigate ground state properties of quantum spin models on infinite two-dimensional lattices using automatic differentiation-based gradient optimization of infinite projected entangled-pair…
Controlled quantum mechanical devices provide a means of simulating more complex quantum systems exponentially faster than classical computers. Such "quantum simulators" rely heavily upon being able to prepare the ground state of…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
The Kitaev honeycomb model is a paradigm of exactly-solvable models, showing non-trivial physical properties such as topological quantum order, abelian and non-abelian anyons, and chirality. Its solution is one of the most beautiful…
The $S=1/2$ Kitaev honeycomb model has attracted significant attention as an exactly solvable example with a quantum spin liquid ground state. In a properly oriented external magnetic field, chiral Majorana edge modes associated with a…
Despite significant work on resource estimation for quantum simulation of electronic systems, the challenge of preparing states with sufficient ground state support has so far been largely neglected. In this work we investigate this issue…
Recently, Singh and Chandrasekharan showed that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In a paper by the NuQS collaboration,…
Quantum circuits have been shown to be a fertile ground for realizing long-range entangled phases of matter. While various quantum double models with non-chiral topological order have been theoretically investigated and experimentally…
Quantum systems have historically been formidable to simulate using classical computational methods, particularly as the system size grows. In recent years, advancements in quantum computing technology have offered new opportunities for…
We present a solution of Kitaev's spin model on the honeycomb lattice and of related topologically ordered spin models. We employ a Jordan-Wigner type fermionization and find that the Hamiltonian takes a BCS type form, allowing the system…
We study the quantum phase transition between Abelian and non-Abelian phases in an extended Kitaev spin model on the honeycomb lattice, where the periodic boundary condition is applied by placing the lattice on a torus. Our analytical…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Quantum spin models with spatially dependent interactions, known as compass models, play an important role in the study of frustrated quantum magnetism. One example is the Kitaev model on the honeycomb lattice with spin-liquid ground states…
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…
Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…