Related papers: AENEAS - A Custom-built Parallel Supercomputer for…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
Analogue gravity helps to find some gravitational systems which are similar to the evolution of perturbation in condensed matter systems. These analogies provide a very good tool for either side. In other words, some aspects of gravity…
We investigate the application of quantum computing algorithms to enhance the efficiency of enumerating self-avoiding walks (SAWs), utilizing quantum properties such as superposition and interference. A Quantum Amplitude Estimation…
We present a model for quantum computation using n steady 3-level atoms or 3-level quantum dots, kept inside a quantum electro-dynamics (QED) cavity. Our model allows one-qubit operations and the two-qubit controlled-NOT gate as required…
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave…
The manipulation of neutral atoms by light is at the heart of countless scientific discoveries in the field of quantum physics in the last three decades. The level of control that has been achieved at the single particle level within arrays…
Affine quantum gravity involves (i) affine commutation relations to ensure metric positivity, (ii) a regularized projection operator procedure to accomodate first- and second-class quantum constraints, and (iii) a hard-core interpretation…
We propose a quantum algorithm for simulation of the Anderson transition in disordered lattices and study numerically its sensitivity to static imperfections in a quantum computer. In the vicinity of the critical point the algorithm gives a…
Experimental quantum physics and computing platforms rely on sophisticated computer control and timing systems that must be deterministic. An exemplar is the sequence used to create a Bose-Einstein condensate at the University of Illinois,…
Inspired by the universality of computation, we advocate for a principle of spacetime complexity, where gravity arises as a consequence of spacetime optimizing the computational cost of its own quantum dynamics. This principle is explicitly…
We consider functional-integral quantisation of the moduli of all quantum metrics defined as square-lengths $a$ on the edges of a Lorentzian square graph. We determine correlation functions and find a fixed relative uncertainty $\Delta…
The main principle of affine quantum gravity is the strict positivity of the matrix \{\hat g_{ab}(x)\} composed of the spatial components of the local metric operator. Canonical commutation relations are incompatible with this principle,…
Quantum annealing (QA) is a heuristic search algorithm that can run on Adiabatic Quantum Computation (AQC) processors to solve combinatorial optimization problems. Although theoretical studies and simulations on classic hardware have shown…
We show how "single" quantum dots, each hosting a singlet-triplet qubit, can be placed in arrays to build a spin quantum cellular automaton. A fast ($\sim 10$ ns) deterministic coherent singlet-triplet filtering, as opposed to current…
As quantum computing enters the Utility Era, realizing near-term advantage relies heavily on Hybrid Variational Quantum Algorithms (VQAs). These algorithms require a tightly coupled, iterative loop between a classical CPU optimizer and a…
We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e., joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits.…
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…
We formulate a non-perturbative lattice model of two-dimensional Lorentzian quantum gravity by performing the path integral over geometries with a causal structure. The model can be solved exactly at the discretized level. Its continuum…
We show how it is possible to formulate Euclidean two-dimensional quantum gravity as the scaling limit of an ordinary statistical system by means of dynamical triangulations, which can be viewed as a discretization in the space of…