Related papers: First-Order Quantum Correction in Coherent State E…
In loop quantum gravity (LQG), states of the gravitational field are represented by labeled graphs called spin networks. Their dynamics can be described by a Hamiltonian constraint, { which acts on the spin network states modifying both…
Experiments at the LHC are collecting a wealth of data with an unprecedented level of precision. As a consequence, the theoretical error is now starting to lag behind the experimental one, and a ceaseless effort is required to reduce the…
We propose a general quantum circuit based on the swap test for measuring the quantity $\langle \psi_1 | A | \psi_2 \rangle$ of an arbitrary operator $A$ with respect to two quantum states $|\psi_{1,2}\rangle$. This quantity is frequently…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
Loop Quantum Gravity (LQG) is a promising approach to quantum gravity, in particular because it is based on a rigorous quantization of the kinematics of gravity. A difficult and still open problem in the LQG program is the construction of…
Constructing an efficient and robust quantum memory is central to the challenge of engineering feasible quantum computer architectures. Quantum error correction codes can solve this problem in theory, but without careful design it can…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
Loop Quantum Gravity heavily relies on a connection formulation of General Relativity such that 1. the connection Poisson commutes with itself and 2. the corresponding gauge group is compact. This can be achieved starting from the Palatini…
Quantum computing, a prominent non-Von Neumann paradigm beyond Moore's law, can offer superpolynomial speedups for certain problems. Yet its advantages in efficiency for tasks like machine learning remain under investigation, and quantum…
The quantum states representing classical phase space are given, and these are used to formulate quantum statistical mechanics as a formally exact double perturbation expansion about classical statistical mechanics. One series of quantum…
We show that the principal part of the Dirac Hamiltonian in 3+1 dimensions emerges in a semi-classical approximation from a construction which encodes the kinematics of quantum gravity. The construction is a spectral triple over a…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
We apply the full theory of Loop Quantum Gravity (LQG) to cosmology and present a top-down derivation of gauge-invariant cosmological perturbation theory from quantum gravity. The derivation employs the reduced phase space formulation of…
Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…
In this article a study was made of the conditions under which a Hamiltonian which is an element of the complex $ \left\{ h (1) \oplus h(1) \right\} \uplus u(2) $ Lie algebra admits ladder operators which are also elements of this algebra.…
Efficient simulation of quantum dynamics with time-dependent Hamiltonians is important not only for time-varying systems but also for time-independent Hamiltonians in the interaction picture. Such simulations are more challenging than their…
The calculation of higher-order corrections in Quantum Field Theories is a challenging task. In particular, dealing with multiloop and multileg Feynman amplitudes leads to severe bottlenecks and a very fast scaling of the computational…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…
We present for the first time an explicit exposition of quantum corrections within the cubic Galileon theory including the effect of quantum gravity, in a background- and gauge-invariant manner, employing the field-reparametrisation…