Related papers: Exploiting dynamic quantum circuits in a quantum a…
Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
Quantum advantage requires overcoming noise-induced degradation of quantum systems. Conventional methods for reducing noise such as error mitigation face scalability issues in deep circuits. Specifically, noise hampers the extraction of…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…
Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…
Simulating noisy quantum circuits is vital in designing and verifying quantum algorithms in the current NISQ (Noisy Intermediate-Scale Quantum) era, where quantum noise is unavoidable. However, it is much more inefficient than the classical…
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine…
In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit)…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
Although near-term quantum computing devices are still limited by the quantity and quality of qubits in the so-called NISQ era, quantum computational advantage has been experimentally demonstrated. Moreover, hybrid architectures of quantum…
Quantum systems are notoriously difficult to simulate with classical means. Recently, the idea of using another quantum system - which is experimentally more controllable - as a simulator for the original problem has gained significant…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…
Due to the scarcity of quantum computing resources, researchers and developers have very limited access to real quantum computers. Therefore, judicious planning and utilization of quantum computer runtime are essential to ensure smooth…
We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical…
Quantum advantage schemes probe the boundary between classically simulatable and classically intractable quantum dynamics. We explore the impact of mid-circuit measurements on the computational power of quantum circuits. To this effect, we…
Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms.…
Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the…
Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum…