相关论文: Quantum geometry and quantum algorithms

It has been proposed that random wide neural networks near Gaussian process are quantum field theories around Gaussian fixed points. In this paper, we provide a novel map with which a wide class of quantum mechanical systems can be cast…

An approximation method which combines the perturbation theory with the variational calculation is constructed for quantum mechanical problems. Using the anharmonic oscillator and the He atom as examples, we show that the present method…

Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…

A theoretical study is made of conformal factors in certain types of physical theories based on classical differential geometry. Analysis of quantum versions of Weyl's theory suggest that similar field equations should be available in four,…

It has been a long-standing problem how to relate Chern-Simons theory to the quantum groups. In this paper we recover the classical $r$-matrix directly from a 3-dimensional Chern-Simons theory with boundary conditions, thus creating a…

We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's…

We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…

The manifold of pure quantum states is a complex projective space endowed with the unitary-invariant geometry of Fubini and Study. According to the principles of geometric quantum mechanics, the detailed physical characteristics of a given…

We introduce a new method for representing the low energy subspace of a bosonic field theory on the qubit space of digital quantum computers. This discretization leads to an exponentially precise description of the subspace of the…

This is the first of a series of two papers devoted to the partition function realization of Wilson surfaces in strict higher gauge theory. A higher version of the Kirillov-Kostant-Souriau theory of coadjoint orbits is presented based on…

This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections…

Quantum geometry, i.e., the quantum theory of intrinsic and extrinsic spatial geometry, is a cornerstone of loop quantum gravity. Recently, there have been many new ideas in this field, and I will review some of them. In particular, after a…

A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…

Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…

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 present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…

The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically…

We design a variational quantum algorithm to solve multi-dimensional Poisson equations with mixed boundary conditions that are typically required in various fields of computational science. Employing an objective function that is formulated…

Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of…