Related papers: Quantum EigenGame for excited state calculation
Quantum computers have an exponential speed-up advantage over classical computers. One of the most prominent utilities of quantum computers is their ability to study complex quantum systems in various fields using quantum computational…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
Quantum phase estimation is the workhorse behind any quantum algorithm and a promising method for determining ground state energies of strongly correlated quantum systems. Low-cost quantum phase estimation techniques make use of circuits…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This…
Variational methods have offered controllable and powerful tools for capturing many-body quantum physics for decades. The recent introduction of expressive neural network quantum states has enabled the accurate representation of a broad…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
The Variational Quantum Eigensolver (VQE) algorithm has been developed to target near term Noisy Intermediate Scale Quantum (NISQ) computers as a method to find the eigenvalues of Hamiltonians. Unlike fully quantum algorithms such as…
We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric…
Using the representation introduced in \cite{frame}, an artificial game in quantum strategy space is proposed and studied. Although it has well-known classical correspondence, which has classical mixture strategy Nash Equilibrium states,…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
We present a new framework for creating a quantum version of a classical game, based on Fine's theorem. This theorem shows that for a given set of marginals, a system of Bell's inequalities constitutes both necessary and sufficient…
Variational Quantum Eigensolver (VQE) provides a lucrative platform to determine molecular energetics in near-term quantum devices. While the VQE is traditionally tailored to determine the ground state wavefunction with the underlying…
With physical quantum computers becoming increasingly accessible, research on their applications across various fields has advanced rapidly. In this paper, we present the first study of quantum cosmology conducted on physical quantum…
Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for…
Through the two specific problems, the 2D hidden linear function problem and the 1D magic square problem, Bravyi et al. have recently shown that there exists a separation between $\mathbf{QNC^0}$ and $\mathbf{NC^0}$, where $\mathbf{QNC^0}$…
Recently, feedback-based quantum algorithms have been introduced to calculate the ground states of Hamiltonians, inspired by quantum Lyapunov control theory. This paper aims to generalize these algorithms to the problem of calculating an…
Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a…