Related papers: Quantum Algorithms for Testing Hamiltonian Symmetr…
We discuss Hamiltonian learning in quantum field theories as a protocol for systematically extracting the operator content and coupling constants of effective field theory Hamiltonians from experimental data. Learning the Hamiltonian for…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
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…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
By quantum calibration we name an experimental procedure apt to completely characterize an unknown measurement apparatus by comparing it with other calibrated apparatuses. Here we show how to achieve the calibration of an arbitrary…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
It is shown how the canonical symmetry is used to look for the hierarchy of the Hamiltonian operators relevant to the system under consideration. It appears that only the invariance condition can be used to solve the problem.
Using quantum systems to efficiently solve quantum chemistry problems is one of the long-sought applications of near-future quantum technologies. In a recent work, ultra-cold fermionic atoms have been proposed for these purposes by showing…
Recent work has shown that the entanglement of finite-temperature eigenstates in chaotic quantum many-body local Hamiltonians can be accurately described by an ensemble of random states with an internal $U(1)$ symmetry. We build upon this…
We explore the interplay between symmetry and randomness in quantum information. Adopting a geometric approach, we consider states as $H$-equivalent if related by a symmetry transformation characterized by the group $H$. We then introduce…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
We consider symmetry as a foundational concept in quantum mechanics and rewrite quantum mechanics and measurement axioms in this description. We argue that issues related to measurements and physical reality of states can be better…
We derive in this study a Hamiltonian to solve with certainty the analog quantum search problem analogue to the Grover algorithm. The general form of the initial state is considered. Since the evaluation of the measuring time for finding…
Quantum simulators, in which well controlled quantum systems are used to reproduce the dynamics of less understood ones, have the potential to explore physics that is inaccessible to modeling with classical computers. However, checking the…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
The capacity to custom tailor the properties of quantum matter and materials is a central requirement for enlarging their range of possible functionalities. A particularly promising route is the use of driving protocols to engineer specific…
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…