Related papers: Conserved charges in the quantum simulation of int…
Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine…
Simulated Quantum Annealing (SQA), that is emulating a Quantum Annealing (QA) dynamics on a classical computer by a Quantum Monte Carlo whose parameters are changed during the simulation, is a well established computational strategy to cope…
Implementing time-evolution operators in shallow quantum circuits is important for quantum simulations. The standard method of Trotterization requires a large number of gates to achieve practical accuracy. Variational Quantum Simulation…
Simulating quantum dynamics on digital or analog quantum simulators often requires ``problem-to-simulator" mappings such as trotterization, floquet-magnus expansion or perturbative expansions. When the simulator is noiseless, it is well…
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…
Spin squeezing is a form of entanglement that can improve the stability of quantum sensors operating with multiple particles, by inducing inter-particle correlations that redistribute the quantum projection noise. Previous analyses of…
Magnetic molecules, modelled as finite-size spin systems, are test-beds for quantum phenomena and could constitute key elements in future spintronics devices, long-lasting nanoscale memories or noise-resilient quantum computing platforms.…
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global…
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. The existing algorithms generally approximate the time evolution operators, which may need a deep…
How a closed interacting quantum many-body system relaxes and dephases as a function of time is a fundamental question in thermodynamic and statistical physics. In this work, we analyse and observe the persistent temporal fluctuations after…
Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. In this work, we analyze…
We explore the applicability of a stochastic time-evolution algorithm based on probabilistic angle interpolation. To simplify the pre-processing of the algorithm, we take the continuous-time limit, thereby explicitly eliminating Trotter…
Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement,…
Digital quantum simulation (DQS) is one of the most promising paths for achieving first useful real-world applications for quantum processors. Yet even assuming rapid progress in device engineering and development of fault-tolerant quantum…
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…
We apply a recently developed quantum theory of spin transfer torque to study the effect of the quantum noise in spin transfer process on the magnetization switching in spin-torque-driven devices. The quantum noise induces considerable…
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it allows for exploiting the large computational capacity of the qubits without suffering from…
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using…
We calculate two-body scattering phase shifts on a quantum computer using a leading order short-range effective field theory Hamiltonian. The algorithm combines the variational quantum eigensolver and the quantum subspace expansion. As an…
Quantum computers offer the potential to efficiently simulate the dynamics of quantum systems, a task whose difficulty scales exponentially with system size on classical devices. To assess the potential for near-term quantum computers to…