Related papers: Taming Trotter Errors with Quantum Resources
Simulating quantum systems is one of the most promising avenues to harness the computational power of quantum computers. However, hardware errors in noisy near-term devices remain a major obstacle for applications. Ideas based on the…
Entanglement and magic are among the most fundamental properties unique to quantum systems. Each quantity captures a different aspect of non-classical behavior, and each can be regarded as a resource within its own operational setting.…
Unraveling the secrets of how much nonstabilizerness a quantum dynamic can generate is crucial for harnessing the power of magic states, the essential resources for achieving quantum advantage and realizing fault-tolerant quantum…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved…
The relation between entanglement entropy and the computational difficulty of classically simulating Quantum Mechanics is briefly reviewed. Matrix product states are proven to provide an efficient representation of one-dimensional quantum…
We propose an approach to the study of quantum resource manipulation based on the basic observation that quantum channels which preserve certain sets of states are contractive with respect to the base norms induced by those sets. We forgo…
Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in…
Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains…
Magic-state resource theory is a fundamental framework with far-reaching applications in quantum error correction and the classical simulation of quantum systems. Recent advances have significantly deepened our understanding of magic as a…
We present a machine learning framework to study the dynamics of entropy vectors and quantum resources, including entanglement and magic, focusing on violations of entropy inequalities. Using a reinforcement learning agent formulated as a…
A fundamental challenge in digital quantum simulation (DQS) is the control of inherent errors. These appear when discretizing the time evolution generated by the Hamiltonian of a quantum many-body system as a sequence of quantum gates,…
Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of the entire Hilbert…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
Simulating the dynamic evolutions of physical and molecular systems in a quantum computer is of fundamental interest in many applications. Its implementation requires efficient quantum simulation algorithms. The Lie-Trotter-Suzuki…
Quantum simulation is a foundational application for quantum computers, projected to offer insights into complex quantum systems beyond the reach of classical computation. However, with the exception of Trotter-based methods, which suffer…
The emergence of quantum technologies has brought much attention to the characterization of quantum resources as well as the classical simulatability of quantum processes. Quantum resources, as quantified by non-stabilizerness, have in one…
The accuracy of quantum dynamics simulation is usually measured by the error of the unitary evolution operator in the operator norm, which in turn depends on certain norm of the Hamiltonian. For unbounded operators, after suitable…
The execution cost of quantum algorithms is typically quantified through asymptotic gate counts and qubit register sizes, yet these metrics do not directly capture which genuinely quantum resources, and in what amount, must be created and…
The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which…
Simulating real-time dynamics under a Hamiltonian is a central goal of quantum information science. While numerous Hamiltonian-simulation quantum algorithms have been proposed, the effects of physical noise have rarely been incorporated…