Related papers: High ground state overlap via quantum embedding me…
The idea of using fragment embedding to circumvent the high computational scaling of accurate electronic structure methods while retaining high accuracy has been a long-standing goal for quantum chemists. Traditional fragment embedding…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
The ability of quantum computers to overcome the exponential memory scaling of many-body problems is expected to transform quantum chemistry. Quantum algorithms require accurate representations of electronic states on a quantum device, but…
The problem of the relationship between entanglement and two-qubit systems in which it is embedded is central to the quantum information theory. This paper suggests that the concurrence hierarchy as an entanglement measure provides an…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
Quantum circuit synthesis and compilation are critical components in the quantum computing stack, both for contemporary quantum systems, where efficient use of limited resources is essential, as well as for large-scale fault-tolerant…
Critical decision-making issues in science, engineering, and industry are based on combinatorial optimization; however, its application is inherently limited by the NP-hard nature of the problem. A specialized paradigm of analogue quantum…
Quantum computing holds transformative potential for medical applications, yet efficiently preparing quantum states from complex medical data remains a fundamental challenge. This survey provides a comprehensive examination of current…
The ghost Gutzwiller ansatz (gGut) embedding technique was shown to achieve comparable accuracy to the gold standard dynamical mean-field theory method in simulating real material properties, yet at a much lower computational cost. Despite…
Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. The square-lattice surface…
We present a concise introduction to quantum entanglement. Concentrating on bipartite systems we review the separability criteria and measures of entanglement. We focus our attention on geometry of the sets of separable and maximally…
Realizing practical quantum computing requires overcoming a number of computation errors and the limitation of device size, which have intensively been tackled by quantum error mitigation (QEM) these days. As a unified approach of…
We address the problem of optimal estimation of the relative phase for two-dimensional quantum systems in mixed states. In particular, we derive the optimal measurement procedures for an arbitrary number of qubits prepared in the same mixed…
In order to quantify the relative performance of different testbed quantum computing devices, it is useful to benchmark them using a common protocol. While some benchmarks rely on the performance of random circuits and are generic in…
A quantum computer will use the properties of quantum physics to solve certain computational problems much faster than otherwise possible. One promising potential implementation is to use superconducting quantum bits in the circuit quantum…
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a symmetric superposition of all possible assignments of $N$…
As quantum technologies mature, the development of tools for benchmarking their ability to prepare and manipulate complex quantum states becomes increasingly necessary. A key concept, the state overlap between two quantum states, offers a…