Related papers: Imaginary Time Propagation on a Quantum Chip
We present fresh evidence for the presence of discrete quantum time crystals in two spatial dimensions. Discrete time crystals are intricate quantum systems that break discrete time translation symmetry in driven quantum many-body systems…
Quantum devices, such as quantum simulators, quantum annealers, and quantum computers, may be exploited to solve problems beyond what is tractable with classical computers. This may be achieved as the Hilbert space available to perform such…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
World-wide efforts aim at the realization of advanced quantum simulators and processors. However, despite the development of intricate hardware and pulse control systems, it may still not be generally known which effective quantum dynamics,…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…
The efficient numerical simulation of nonequilibrium real-time evolution in isolated quantum matter constitutes a key challenge for current computational methods. This holds in particular in the regime of two spatial dimensions, whose…
In designing quantum control, it is generally required to simulate the controlled system evolution with a classical computer. However, computing the time evolution operator can be quite resource-consuming since the total Hamiltonian is…
We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for…
Recent technological advances have allowed the fabrication of large arrays of coupled qubits serving as prototypes of quantum processors. However, the optimal control of such systems is notoriously hard, which limits the potential of…
Complex numbers, intrinsic to the formulation of quantum theory, play a pivotal role in enabling advantages across a broad range of quantum information-processing tasks. Despite their fundamental importance, practical and scalable criteria…
We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…
We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an…
Quantum imaginary time evolution (QITE) is a powerful method to derive the ground states of the systems. Only the damping of quantum states leads it; hence, reaching the ground state is guaranteed by nature without any external…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
In the pursuit of numerically identifying the ground state of quantum many-body systems, approximate quantum wavefunction ansatzes are commonly employed. This study focuses on the spectral decomposition of these approximate quantum…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible,…