Related papers: H-EFT-VA: An Effective-Field-Theory Variational An…
We analyze the barren plateau phenomenon in the variational optimization of quantum circuits inspired by matrix product states (qMPS), tree tensor networks (qTTN), and the multiscale entanglement renormalization ansatz (qMERA). We consider…
Variational quantum algorithms (VQAs) face an inherent trade-off between expressivity and trainability: deeper circuits can represent richer states but suffer from noise accumulation and barren plateaus, while shallow circuits remain…
We introduce a novel approach to variational Quantum algorithms (VQA) via continuous bandits. VQA are a class of hybrid Quantum-classical algorithms where the parameters of Quantum circuits are optimized by classical algorithms. Previous…
Vector quantization (VQ) is a technique to deterministically learn features with discrete codebook representations. It is commonly performed with a variational autoencoding model, VQ-VAE, which can be further extended to hierarchical…
Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition…
Variational quantum eigensolvers (VQEs) are one of the most important and effective applications of quantum computing, especially in the current noisy intermediate-scale quantum (NISQ) era. There are mainly two ways for VQEs:…
Variational quantum algorithms (VQAs) have enabled a wide range of applications on near-term quantum devices. However, their scalability is fundamentally limited by barren plateaus, where the probability of encountering large gradients…
Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained…
We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the…
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…
The barren plateau phenomenon, characterized by loss gradients that vanish exponentially with system size, poses a challenge to scaling variational quantum algorithms. Here we explore the potential of warm starts, whereby one initializes…
Simulating quantum many-body systems represents a fundamental challenge where classical machine learning methods are severely bottlenecked by the exponential curse of dimensionality. Variational Quantum Algorithms (VQAs) offer a native…
Variational Quantum Circuits are being used as versatile Quantum Machine Learning models. Some empirical results exhibit an advantage in supervised and generative learning tasks. However, when applied to Reinforcement Learning, less is…
The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian, a problem that is central to quantum chemistry and condensed matter physics. Conventional computing methods are…
Quantum machine learning -- and specifically Variational Quantum Algorithms (VQAs) -- offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data…
This work presents a comprehensive benchmark and validation of a recently proposed method called Effective Bethe Ansatz (EBA). It is a variational method that deforms the exact Bethe wavefunctions of one-dimensional spin chains at…
One of the most promising applications for near term quantum computers is the simulation of physical quantum systems, particularly many-electron systems in chemistry and condensed matter physics. In solid state physics, finding the correct…
Effective field theories (EFT) are commonly used to parameterize effects of BSM physics in vector boson scattering (VBS). For Wilson coefficients which are large enough to produce presently observable effects, the validity range of the EFT…
We introduce a variational quantum annealing (VarQA) algorithm for electronic structure theory, in which we use the quantum annealer as a sampler and prepare an ansatz state through its statistics. We also introduce a strategy called the…
Variational quantum algorithms (VQAs) for combinatorial optimization routinely employ entangling gates as a default design choice, yet the role of entanglement, in its amount and structure, remains poorly understood. This gap is…