Related papers: Testing the Master Constraint Programme for Loop Q…
Given the limitations of current hardware, the theoretical gains promised by quantum computing remain unrealized across practical applications. But the gap between theory and hardware is closing, assisted by developments in quantum…
Previous works (by Almiehri, Dong, Harlow, Pastakawski, Preskill, Yoshida and others) have established that quantum error correction plays an important role in understanding how the bulk degrees of freedom of an Anti-deSitter spacetime are…
Due to the limited connectivity of gate model quantum devices, logical quantum circuits must be compiled to target hardware before they can be executed. Often, this process involves the insertion of SWAP gates into the logical circuit,…
Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we reformulate QPs as a mixed-integer linear problem (MILP). This…
The purpose of this paper is to study the mixed linear quadratic Gaussian (LQG) and $H_\infty$ optimal control problem for linear quantum stochastic systems, where the controller itself is also a quantum system, often referred to as…
In this article, we review the use of numerical techniques to obtain solutions for the quantum Hamiltonian constraint in loop quantum cosmology (LQC). First, we summarize the basic features of LQC, and describe features of the constraint…
Development of quantum gravity theories rarely takes inputs from experimental physics. In this letter, we take a small step towards correcting this by establishing a paradigm for incorporating putative quantum corrections, arising from…
Quantum error correction (QEC) codes are traditionally defined and searched for without specifying the manner in which its syndrome extraction circuits are executed using elementary gates and measurements. We show how morphing circuits…
The theory of canonical linearized gravity is quantized using the Projection Operator formalism, in which no gauge or coordinate choices are made. The ADM Hamiltonian is used and the canonical variables and constraints are expanded around a…
In this work we exploit Dirac's Constraint Analysis (DCA) in Hamiltonian formalism to study different types of Superconducting Quantum Circuits (SQC) in a {\it{unified}} way. The Lagrangian of a SQC reveals the constraints, that are…
The implementation of the dynamics in Loop Quantum Gravity (LQG) is still an open problem. Here, we discuss a tentative dynamics for the simplest class of graphs in LQG: Two vertices linked with an arbitrary number of edges. We use the…
Quantum Hamiltonian Descent (QHD) is a continuous optimization algorithm based on simulating a time-dependent quantum Hamiltonian whose potential energy encodes the objective function and whose kinetic energy promotes exploration through…
An extension of the Dirac procedure for the quantization of constrained systems is necessary to address certain issues that are left open in Dirac's original proposal. These issues play an important role especially in the context of…
Degenerate geometrical configurations in quantum gravity are important to understand if the fate of classical singularities is to be revealed. However, not all degenerate configurations arise on an equal footing, and one must take into…
In this work we apply Dirac's Constraint Analysis (DCA) to solve Superconducting Quantum Circuits (SQC). The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework, such that redundant variables can be…
We propose a general framework for decoding quantum error-correcting codes with generative modeling. The model utilizes autoregressive neural networks, specifically Transformers, to learn the joint probability of logical operators and…
This article sheds new light on the problem of cosmological reduction in Loop Quantum Gravity. We critically analyze Quantum Reduced Loop Gravity -- an attempt to extract the cosmological sector of the full theory. We reconsider the…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
The main contribution of this thesis is the development of a new algorithm for solving convex quadratic programs. It consists in combining the method of multipliers with an infeasible active-set method. Our approach is iterative. In each…
When applying the techniques of Loop Quantum Gravity (LQG) to symmetry-reduced gravitational systems, one first regularizes the scalar constraint using holonomy corrections, prior to quantization. In inhomogeneous system, where a residual…