Related papers: Quantum Variational Methods for Supersymmetric Qua…
Adaptive Variational Quantum Dynamics (AVQD) algorithms offer a promising approach to providing quantum-enabled solutions for systems treated within the purview of open quantum dynamical evolution. In this study, we employ the unrestricted…
Understanding the real-time evolution of many-electron quantum systems is essential for studying dynamical properties in condensed matter, quantum chemistry, and complex materials, yet it poses a significant theoretical and computational…
Quantum simulation of chemical systems is one of the most promising near-term applications of quantum computers. The variational quantum eigensolver, a leading algorithm for molecular simulations on quantum hardware, has a serious…
Simulations of supersymmetric field theories on the lattice with (spontaneously) broken supersymmetry suffer from a fermion sign problem related to the vanishing of the Witten index. We propose a novel approach which solves this problem in…
Variational quantum algorithms exploit the features of superposition and entanglement to optimize a cost function efficiently by manipulating the quantum states. They are suitable for noisy intermediate-scale quantum (NISQ) computers that…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
Quasiparticle band structures are fundamental for understanding strongly correlated electron systems. While solving these structures accurately on classical computers is challenging, quantum computing offers a promising alternative.…
A systematic procedure is developed for constructing fermion systems in discrete space-time which have a given outer symmetry. The construction is illustrated by simple examples. For the symmetric group, we derive constraints for the number…
Boson is one of the most basic types of particles and preserves the commutation relation. An efficient way to measure a bosonic system is important not only for simulating complex physics phenomena of bosons (such as nuclei) on a qubit…
We study spontaneous symmetry breaking in quantum field theories with fermionic order parameters and construct, for the first time in the literature, the constraint effective potential for it. The Grassmann-valued constraint we encounter is…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
In this work, a novel mechanism for spontaneous symmetry breaking is presented. This mechanism avoids quadratic divergencies and is thus capable of addressing the hierarchy problem in gauge theories. Using the scale-dependent effective…
We propose a general extended coherent state approach to the qubit (or fermion) and multi-mode boson coupling systems. The application to the spin-boson model with the discretization of a bosonic bath with arbitrary continuous spectral…
We study the systematic errors of L\"uscher's formulation of dynamical Wilson quarks and some of its variants, in the weak and strong coupling limits, and on a sample of small configurations at finite $\beta$. We confirm the existence of an…
Efficient ways to prepare fermionic ground states on quantum computers are in high demand and different techniques have been developed over the last years. Despite having a vast set of methods, it is still unclear which method performs well…
This work introduces a novel approach to quantum simulation by leveraging continuous-variable systems within a photonic hardware-inspired framework. The primary focus is on simulating static properties of the ground state of Hamiltonians…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved…
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits.…
Variational quantum algorithms are promising tools for near-term quantum computers as their shallow circuits are robust to experimental imperfections. Their practical applicability, however, strongly depends on how many times their circuits…
Variational Quantum Algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In variational quantum algorithm, wavefunction represented by a parametrized…