Related papers: Light-Front Field Theory on Current Quantum Comput…
The real world obeys quantum physics and quantum computing presents an alternative way to map physical problems to systems that follow the same laws. Such computation fundamentally constitutes a better way to understand the most challenging…
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…
State-of-the-art cosmological simulations on classical computers are limited by time, energy, and memory usage. Quantum computers can perform some calculations exponentially faster than classical computers, using exponentially less energy…
Digital quantum simulation uses the capabilities of quantum computers to determine the dynamics of quantum systems, which are beyond the computability of modern classical computers. A notoriously challenging task in this field is the…
In this thesis we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement and the exploration of the use of controlled quantum systems to the simulation of quantum…
Gauge invariant regularization of quantum field theory in the framework of Light-Front (LF) Hamiltonian formalism via introducing a lattice in transverse coordinates and imposing boundary conditions in LF coordinate $x^-$ for gauge fields…
The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially…
We present a novel quantum algorithm for approximating the ground-state in quantum many-body systems, particularly suited for Noisy Intermediate-Scale Quantum (NISQ) devices. Our approach integrates Variational Quantum Eigensolvers (VQE)…
We present the first application of the recently developed Basis Light-Front Quantization (BLFQ) method to self-bound systems in quantum field theory, using the positronium system as a test case. Within the BLFQ framework, we develop a…
Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the space they occupy. We present first quantum simulations based…
Simulation of time dynamical physical problems has been a challenge for classical computers due to their time-complexity. To demonstrate the dominance of quantum computers over classical computers in this regime, here we simulate a…
We investigate quark matter at finite temperature and finite chemical potential as an example for a relativistic many-particle quantum system. Special relativity is realized through the front form that allows for a Hamiltonian formulation…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
Hamiltonian light-front dynamics of quantum fields may provide a useful approach to systematic non-perturbative approximations to quantum field theories. We investigate inequivalent Hilbert-space representations of the light-front field…
The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…
Advances in quantum simulator technology is increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially…
Variational quantum algorithms (VQAs) have emerged in recent years as a promise to obtain quantum advantage. These task-oriented algorithms work in a hybrid loop combining a quantum processor and classical optimization. Using a specific…
Quantum computers can be used to calculate the electronic structure and estimate the ground state energy of many-electron molecular systems. In the present study, we implement the Variational Quantum Eigensolver (VQE) algorithm, as a hybrid…
Variational algorithms are promising candidates to be implemented on near-term quantum computers. The variational quantum eigensolver (VQE) is a prominent example, where a parametrized trial state of the quantum mechanical wave function is…
Variational quantum algorithms offer a promising framework for solving eigenvalue problems on near-term quantum hardware, yet their applicability beyond electronic structure calculations remains relatively unexplored. In this work, we…