Related papers: The Dilemma of Random Parameter Initialization and…
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution,…
Solving quantum many-body systems is one of the most significant regimes where quantum computing applies. Currently, as a hardware-friendly computational paradigms, variational algorithms are often used for finding the ground energy of…
Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale…
In recent years, Variational Quantum Algorithms (VQAs) have emerged as a promising approach for solving optimization problems on quantum computers in the NISQ era. However, one limitation of VQAs is their reliance on fixed-structure…
Variational quantum algorithms (VQAs) promise near-term quantum advantage, yet parametrized quantum states commonly built from the digital gate-based approach often suffer from scalability issues such as barren plateaus, where the loss…
Parameterised quantum circuits (PQCs) hold great promise for demonstrating quantum advantages in practical applications of quantum computation. Examples of successful applications include the variational quantum eigensolver, the quantum…
We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. The method uses simulated annealing of the efficiently simulable Clifford parameter points as a pre-optimisation to…
The training of a parameterized model largely depends on the landscape of the underlying loss function. In particular, vanishing gradients are a central bottleneck in the scalability of variational quantum algorithms (VQAs), and are known…
This paper presents methodological improvements to variational quantum algorithms (VQAs) for solving multicriteria optimization problems. We introduce two key contributions. First, we reformulate the parameter optimization task of VQAs as a…
Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and…
While Quantum Convolutional Neural Networks (QCNNs) offer a theoretical paradigm for quantum machine learning, their practical implementation is severely bottlenecked by barren plateaus -- the exponential vanishing of gradients -- and poor…
Variational Quantum Algorithms (VQAs) are widely used in the noisy intermediate-scale quantum (NISQ) era, but their trainability and performance depend critically on initialization parameters that shape the optimization landscape. Existing…
Quantum computing is among the most promising emerging techniques to solve problems that are computationally intractable on classical hardware. A large body of existing works focus on using variational quantum algorithms on the gate level…
Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. Applying a VQA to a problem involves optimizing a parameterized quantum circuit by maximizing or minimizing a cost…
Quantum computers currently rely on a hybrid quantum-classical approach known as Variational Quantum Algorithms (VQAs) to solve problems. Still, there are several challenges with VQAs on the classical computing side: it corresponds to a…
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…
Variational quantum algorithms (VQAs) are hybrid quantum-classical approaches used for tackling a wide range of problems on noisy intermediate-scale quantum (NISQ) devices. Testing these algorithms on relevant hardware is crucial to…
We find that using neural networks to generate quantum states can effectively alleviate the barren plateau phenomenon present in random variational quantum circuits.
We prove the existence of barren plateaus in variational quantum algorithms using linear optics with either bosonic or fermionic particles and demonstrate that fermionic linear optics is less susceptible to the barren plateau problem. We…
The barren plateau problem in quantum neural networks (QNNs) is a significant challenge that hinders the practical success of QNNs. In this paper, we introduce residual quantum neural networks (ResQNets) as a solution to address this…