Related papers: A Matrix Big Bang on a Quantum Computer
The effective action of superstring theory or M-theory is approximated by supergravity in the low energy limit, and quantum corrections to the supergravity are taken into account by including higher derivative terms. In this paper, we…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on…
Counting the number of clusters, when these clusters overlap significantly is a challenging problem in machine learning. We argue that a purely mathematical quantum theory, formulated using the path integral technique, when applied to…
We explore the implications of restricting the framework of quantum theory and quantum computation to finite fields. The simplest proposed theory is defined over arbitrary finite fields and loses the notion of unitaries. This makes such…
Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while…
In this review, we aim to utilize the bootstrap method to study models that have received significant interest in high energy theory and holography recently. Matrix bootstrap is proposed to determine the range of the solution up to an…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
We claim that the dynamics of noncritical string theories in two dimensions is related to an underlying noncritical version of M-theory, which we define in terms of a double-scaled nonrelativistic Fermi liquid in 2+1 dimensions. After…
Modal quantum theory (MQT) is a "toy model" of quantum theory in which amplitudes are elements of a general field. The theory predicts, not the probabilities of a measurement result, but only whether or not a result is possible. In this…
We discuss a simple cosmological model derived from M-theory. Three assumptions lead naturally to a pre-big bang scenario: (a) 11-dimensional supergravity describes the low-energy world; (b) non-gravitational fields live on a…
We consider M theory 5-branes with compact transverse dimensions. In certain limits the theory on the 5-brane decouples and defines ``little string theories'' in 5+1 dimensions. We show that the familiar structure of IIA/IIB,M,F- theory in…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Matrix product states (MPS) are a standard tensor-network representation for ground states of one-dimensional quantum many-body systems, and they underpin widely used simulation tools such as DMRG. However, while quantum model checking has…
We derive the full canonical formulation of the bosonic sector of 11-dimensional supergravity, and explicitly present the constraint algebra. We then compactify M-theory on a warped product of homogeneous spaces of constant curvature, and…
Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
The observable universe could be a 1+3-surface (the "brane") embedded in a 1+3+d-dimensional spacetime (the "bulk"), with standard-model particles and fields trapped on the brane while gravity is free to access the bulk. At least one of the…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…