Related papers: Probing infinite many-body quantum systems with fi…
The comprehension of quantum phase transitions (QPTs) is considered as a critical foothold in the field of many-body physics. Developing protocols to effectively identify and understand QPTs thus represents a key but challenging task for…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
While general quantum many-body systems require exponential resources to be simulated on a classical computer, systems of non-interacting fermions can be simulated exactly using polynomially scaling resources. Such systems may be of…
Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT)…
This paper introduces the indigenous Quantum Network Simulator developed to simulate various quantum network protocols on classical machines. The paper specifically focuses on the simulation of entanglement generation between two quantum…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
In this paper, we explore (2+1)D quantum electrodynamics (QED) at finite density on a quantum computer, including two fermion flavors. Our method employs an efficient gauge-invariant ansatz together with a quantum circuit structure that…
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's…
Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
We introduce a unified Gaussian quantum operator representation for fermions and bosons. The representation extends existing phase-space methods to Fermi systems as well as the important case of Fermi-Bose mixtures. It enables simulations…
Open many-body quantum systems have attracted renewed interest in the context of quantum information science and quantum transport with biological clusters and ultracold atomic gases. The physical relevance in many-particle bosonic systems…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Background: Idealised systems are commonly used in nuclear physics and condensed matter. For instance, the construction of nuclear energy density functionals involves properties of infinite matter, while neutron drops are used to test…
Neutral-atom quantum simulators offer a promising approach to the exploration of strongly interacting many-body systems, with applications spanning condensed matter, statistical mechanics, and high-energy physics. Through a combination of…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…
A construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the…
Estimating physical properties of quantum states from measurements is one of the most fundamental tasks in quantum science. In this work, we identify conditions on states under which it is possible to infer the expectation values of all…
Simulation of materials is one of the most promising applications of quantum computers. On near-term hardware the crucial constraint on these simulations is circuit depth. Many quantum simulation algorithms rely on a layer of unitary…