Related papers: Quantum circuit synthesis for fermionic excitation…
The Jordan-Wigner transformation establishes a duality between $su(2)$ and fermionic algebras. We present qualitative arguments and numerical evidence that when mapping spins to fermions, the transformation makes strong correlation weaker,…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
Quantization of the system comprising gravitational, fermionic and electromagnetic fields is developed in the loop representation. As a result we obtain a natural unified quantum theory. Gravitational field is treated in the framework of…
We present a study of the two dimensional circular quantum dot model Hamiltonian using a range of quantum chemical ab initio methods. Ground and excited state energies are computed on different levels of perturbation theories including the…
Quantum computers are expected to give major speed-ups for the simulation of quantum systems. In these conference proceedings, we discuss quantum algorithms for the simulation of perturbative Quantum Chromodynamics (QCD) processes. In…
In loop quantum gravity approach to Planck scale physics, quantum geometry is represented by superposition of the so-called spin network states. In the recent literature, a class of spin networks promising from the perspective of quantum…
Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the locality of the operators comes at the expense of increasing the Hilbert space with auxiliary degrees of freedom. In order to…
Quantum computing has the potential to significantly speed up complex computational tasks, and arguably the most promising application area for near-term quantum computers is the simulation of quantum mechanics. To make the most of our…
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
The structure and dynamics of an n-particle system are described with coupled nonlinear Heisenberg's commutator equations where the nonlinear terms are generated by the two-body interaction that excites the reference vacuum via…
Catalytic processes are vital in the chemical industry, with nitrogen-to-ammonia conversion being a major industrial process. Designing catalysts relies on computational chemistry methods like Density Functional Theory (DFT), which have…
In the context of high-energy particle physics, a reliable theory-experiment confrontation requires precise theoretical predictions. This translates into accessing higher-perturbative orders, and when we pursue this objective, we inevitably…
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…
Quantum computational chemistry has emerged as an important application of quantum computing. Hybrid quantum-classical computing methods, such as variational quantum eigensolvers (VQE), have been designed as promising solutions to quantum…
We study fermionic and bosonic systems coupled to a real or synthetic static gauge field that is quantized, so the field itself is a quantum degree of freedom and can exist in coherent superposition. A natural example is electrons on a…
A new model of quantum computation is considered, in which the connections between gates are programmed by the state of a quantum register. This new model of computation is shown to be more powerful than the usual quantum computation, e. g.…
We show that quantum computation circuits using coherent states as the logical qubits can be constructed from simple linear networks, conditional photon measurements and "small" coherent superposition resource states.
All algebras in a very large, axiomatically defined class of quantum nilpotent algebras are proved to possess quantum cluster algebra structures under mild conditions. Furthermore, it is shown that these quantum cluster algebras always…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…