Related papers: Describing Trotterized Time Evolutions on Noisy Qu…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
The efficiency of the future devices for quantum information processing will be limited mostly by the finite decoherence rates of the individual qubits and quantum gates. Recently, substantial progress was achieved in enhancing the time…
Noise is a major challenge in quantum computing, affecting the reliability of quantum protocols. In this work, we analytically study the impact of various noise processes, such as depolarization, bit flip, and phase flip, on the quantum…
Previous studies in quantum information have recognized that specific types of noise can encode information in certain applications. However, the role of noise in Quantum Hypothesis Testing (QHT), traditionally assumed to undermine…
The study of information scrambling has profoundly deepened our understanding of many-body quantum systems. Much recent research has been devote to understanding the interplay between scrambling and decoherence in open systems. Continuing…
We present a quantum open-system approach to analyze the nonunitary dynamics of a superconducting qubit when it evolves under the influence of external noise. We consider the presence of longitudinal and transverse environmental…
Stable quantum computation requires noisy results to remain bounded even in the presence of noise fluctuations. Yet non-stationary noise processes lead to drift in the varying characteristics of a quantum device that can greatly influence…
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…
The development of fault-tolerant quantum processors relies on the ability to control noise. A particularly insidious form of noise is temporally correlated or non-Markovian noise. By combining randomized benchmarking with supervised…
As the size of quantum hardware progressively increases, the conjectured computational advantages of quantum technologies tend to be threatened by noise, which randomly corrupts the design of quantum logical gates. Several methods already…
Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly.…
We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…
Simulating vibrational dynamics is essential for understanding molecular structure, unlocking useful applications such as vibrational spectroscopy for high-fidelity chemical detection. Quantum algorithms for vibrational dynamics are…
We study the behavior of errors in the quantum simulation of spin systems with long-range multi-body interactions resulting from the Trotter-Suzuki decomposition of the time-evolution operator. We identify a regime where the Floquet…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Much recent experimental effort has focused on the realization of exotic quantum states and dynamics predicted to occur in periodically driven systems. But how robust are the sought-after features, such as Floquet topological surface…
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 simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…
We study a variation of the Trotter-Suzuki decomposition, in which a Hamiltonian exponential is approximated by an ordered product of two-qubit operator exponentials such that the Trotter step size is enhanced for a small number of terms.…
The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood…