Related papers: Spacetime as a quantum circuit
Starting from a new understanding of the vacuum energy problem based on the combination of the phase space regularization and the holographic bound, we argue that quantum gravity should be understood as gravitized quantum theory, that is,…
We show how quantum fields can be used to measure the curvature of spacetime. In particular, we find that knowledge of the imprint that spacetime curvature leaves in the correlators of quantum fields suffices, in principle, to reconstruct…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
Electronic structure simulation is an anticipated application for quantum computers. Due to high-dimensional quantum entanglement in strongly correlated systems, the quantum resources required to perform such simulations are far beyond the…
We derive an effective Hamiltonian for a quantum system constrained to a submanifold (the constraint manifold) of configuration space (the ambient space) by an infinite restoring force. We pay special attention to how this Hamiltonian…
The flat, homogeneous, and isotropic universe with a massless scalar field is a paradigmatic model in Loop Quantum Cosmology. In spite of the prominent role that the model has played in the development of this branch of physics, there still…
One of the central difficulties of settling the $L^2$-bounded curvature conjecture for the Einstein -Vacuum equations is to be able to control the causal structure of spacetimes with such limited regularity. In this paper we show how to…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
Hamiltonian simulation is one of the most promising candidates for the demonstration of quantum advantage within the next ten years, and several studies have proposed end-to-end resource estimates for executing such algorithms on…
We propose a mathematical structure, based on a noncommutative geometry, which combines essential aspects of general relativity and quantum mechanics, and leads to correct "limiting cases" of both these theories. We quantize a groupoid…
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational…
Circuit optimization is a fundamental task for practical applications of near-term quantum computers. In this work we address this challenge through the powerful lenses of tensor network theory. Our approach involves the full…
Hypergraph partitioning is a fundamental optimization problem with applications in data management and other domains involving higher-order relations. In this paper, we study balanced hypergraph partitioning from the perspective of quantum…
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider "space-like cuts" where an entangling unitary is…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum…
A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into a set of computations that…
Combinatorial quantum gravity is governed by a discrete Einstein-Hilbert action formulated on an ensemble of random graphs. There is strong evidence for a second-order quantum phase transition separating a random phase at strong coupling…
Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We…
Many methods solve Poisson equations by using grid techniques which discretize the problem in each dimension. Most of these algorithms are subject to the curse of dimensionality, so that they need exponential runtime. In the paper "Quantum…