Related papers: No Quantum Utility from Hadron Masses? No, Quantum…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
An overarching scientific challenge for the coming decade is to discover the meaning of confinement, its relationship to dynamical chiral symmetry breaking (DCSB) - the origin of visible mass - and the connection between them. In…
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…
Fully covariant wave equations predict the existence of a class of inertial-gravitational effects that can be tested experimentally. In these equations inertia and gravity appear as external classical fields, but, by conforming to general…
The question of the origin of hadron masses is one major issue in the understanding of the strong interaction. The challenge is addressed by searching for indications of in-medium modifications of hadron properties and studying hadrons in…
An inequality in quantum mechanics, which does not appear to be well known, is derived by elementary means and shown to be quite useful. The inequality applies to 'all' operators and 'all' pairs of quantum states, including mixed states. It…
Lattice QCD simulations tend to become stuck in a single topological sector at fine lattice spacing or when using chirally symmetric overlap quarks. In such cases physical observables differ from their full QCD counterparts by finite volume…
Sign problem in quantum Monte Carlo (QMC) simulation appears to be an extremely hard yet interesting problem. In this article, we present a pedagogical overview on the origin of the sign problem in various quantum Monte Carlo simulation…
Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
Quantum reservoir computing offers a promising approach to the utilization of complex quantum dynamics in machine learning. Statistical noise inevitably arises in real settings of quantum reservoir computing (QRC) due to the practical…
In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
When gravity is quantum, the point structure of space-time should be replaced by a non-commutative geometry. This is true even for quantum gravity in the infrared. Using the octonions as space-time coordinates, we construct a pre-spacetime,…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
Recent work of Bravyi et al. and follow-up work by Bene Watts et al. demonstrates a quantum advantage for shallow circuits: constant-depth quantum circuits can perform a task which constant-depth classical (i.e., AC$^0$) circuits cannot.…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
The laws of thermodynamics apply equally well to quantum systems as to classical systems, and because of this quantum effects do not change the fundamental thermodynamic efficiency of isothermal refrigerators or engines. We show that,…