Related papers: Enabling Lie-Algebraic Classical Simulation beyond…
We consider the probabilistic description of nonrelativistic, spinless one-particle classical mechanics, and immerse the particle in a deformed noncommutative phase space in which position coordinates do not commute among themselves and…
We propose a non-linear, hybrid quantum-classical scheme for simulating non-equilibrium dynamics of strongly correlated fermions described by the Hubbard model in a Bethe lattice in the thermodynamic limit. Our scheme implements…
The Lyman-alpha forest provides strong constraints on both cosmological parameters and intergalactic medium astrophysics, which are forecast to improve further with the next generation of surveys including eBOSS and DESI. As is generic in…
Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Despite…
Quantum chemical simulations can be greatly accelerated by constructing machine learning potentials, which is often done using active learning (AL). The usefulness of the constructed potentials is often limited by the high effort required…
We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
A Hamiltonian lattice formulation of lattice gauge theories opens the possibility for quantum simulations of the non-perturbative dynamics of QCD. By parametrizing the gauge invariant Hilbert space in terms of plaquette degrees of freedom,…
The construction of quantum circuits to simulate Hamiltonian evolution is central to many quantum algorithms. State-of-the-art circuits are based on oracles whose implementation is often omitted, and the complexity of the algorithm is…
Gradient estimation is a central challenge in training parameterized quantum circuits (PQCs) for hybrid quantum-classical optimization and learning problems. This difficulty arises from several factors, including the exponential…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
A recent promising arena for quantum advantage is simulating exponentially large classical systems. Here, we show how this advantage can be used to calculate the dynamics of open classical systems experiencing dissipation, including the…
By considering (non-relativistic) quantum mechanics as it is done in practice in particular in condensed-matter physics, it is argued that a deterministic, unitary time evolution within a chosen Hilbert space always has a limited scope,…
Upcoming galaxy surveys will bring a wealth of information about the clustering of matter, but modeling small-scale structure beyond $\Lambda$CDM remains computationally challenging. While accurate N-body emulators exist to model the matter…
The trade-off between accuracy and computational cost as a function of the size and number of simulation boxes was studied for large-scale phase-field simulations. For this purpose, a reference simulation box was incrementally partitioned.…
Quantum computing has the potential to reduce the computational cost required for quantum dynamics simulations. However, existing quantum algorithms for coupled electron-nuclear dynamics simulation either require fault-tolerant devices, or…
Simulating noiseless quantum dynamics classically faces a fundamental dilemma: tensor-network methods become inefficient as entanglement saturates, while Pauli-truncation approaches typically rely on noise or randomness. To close the gap,…
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original fermions into qubits and instead relies on reformulating…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…