Related papers: Quantum Resources for Pure Thermal Shadows
Quantum circuits form a foundational framework in quantum science, enabling the description, analysis, and implementation of quantum computations. However, designing efficient circuits, typically constructed from single- and two-qubit…
Understanding relaxation processes is an important unsolved problem in many areas of physics. A key challenge in studying such non-equilibrium dynamics is the scarcity of experimental tools for characterizing their complex transient states.…
We investigate a probe state preparation protocol based on two non-selective generalized quantum measurements to enhance parameter estimation in single-qubit systems. By fine-tuning the measurement strengths, we demonstrate the ability to…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
Dissipative collective effects are ubiquitous in quantum physics, and their relevance ranges from the study of entanglement in biological systems to noise mitigation in quantum computers. Here, we put forward the first fully quantum…
Universal fault-tolerant quantum computers require millions of qubits with low error rates. Since this technology is years ahead, noisy intermediate-scale quantum (NISQ) computation is receiving tremendous interest. In this setup, quantum…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
Quantum state smoothing is a technique for assigning a valid quantum state to a partially observed dynamical system, using measurement records both prior and posterior to an estimation time. We show that the technique is greatly simplified…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
In the near future, a major challenge in quantum computing is to scale up robust qubit prototypes to practical problem sizes and to implement comprehensive error correction for computational precision. Due to inevitable quantum…
We provide more sample-efficient versions of some basic routines in quantum data analysis, along with simpler proofs. Particularly, we give a quantum "Threshold Search" algorithm that requires only $O((\log^2 m)/\epsilon^2)$ samples of a…
Quantum systems have an exponentially large degree of freedom in the number of particles and hence provide a rich dynamics that could not be simulated on conventional computers. Quantum reservoir computing is an approach to use such a…
Quantum technology has the potential to revolutionize how we acquire and process experimental data to learn about the physical world. An experimental setup that transduces data from a physical system to a stable quantum memory, and…
Two identical finite quantum systems prepared initially at different temperatures, isolated from the environment, and subsequently brought into contact are demonstrated to relax towards Gibbs-like quasi-equilibrium states with a common…
The new scheme employed (throughout the thermodynamic phase space), in the statistical thermodynamic investigation of classical systems, is extended to quantum systems. Quantum Nearest Neighbor Probability Density Functions are formulated…
Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic…
Randomness is a cornerstone of science, underpinning fields such as statistics, information theory, dynamical systems, and thermodynamics. In quantum science, quantum randomness, especially random pure states, plays a pivotal role in…
We investigate the sampling efficiency for the simulations of quantum many-body systems at finite temperatures when initial sampling states are generated by applying Trotter gates to random phase product states (RPPSs). We restrict the…
Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors,…
Gibbs sampling is fundamental to a wide range of computer algorithms. Such algorithms are set to be replaced by physics based processors$-$be it quantum or stochastic annealing devices$-$which embed problem instances and evolve a physical…