Related papers: Measurement-induced entanglement phase transitions…
The entanglement-induced barren plateau is an exponential vanishing of the parameter gradients with system size that limits the practical application of variational quantum algorithms(VQA). A landscape transition from barren plateau to…
Hybrid quantum-classical variational algorithms are one of the most propitious implementations of quantum computing on near-term devices, offering classical machine learning support to quantum scale solution spaces. However, numerous…
Variational quantum algorithms (VQAs) hold great potentials for near-term applications and are promising to achieve quantum advantage on practical tasks. However, VQAs suffer from severe barren plateau problem as well as have a large…
Variational quantum algorithms (VQAs) have emerged as the leading strategy to obtain quantum advantage on the current noisy intermediate-scale devices. However, their entanglement-trainability correlation, as the major reason for the barren…
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…
Variational quantum algorithms (VQAs) have emerged as a leading paradigm in near-term quantum computing, yet their performance can be hindered by the so-called barren plateau problem, where gradients vanish exponentially with system size or…
A large ongoing research effort focuses on Variational Quantum Algorithms (VQAs), representing leading candidates to achieve computational speed-ups on current quantum devices. The scalability of VQAs to a large number of qubits, beyond the…
The variational quantum algorithm (VQA) with a parametrized quantum circuit is widely applicable to near-term quantum computing, but its fundamental issues that limit optimization performance have been reported in the literature. For…
Quantum variational algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quantum circuits are configured in a problem-specific manner,…
The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the…
We investigate entanglement phase transitions from volume-law to area-law entanglement in a quantum many-body state under continuous position measurement on the basis of the quantum trajectory approach. We find the signatures of the…
Ergodic quantum many-body systems undergoing unitary dynamics evolve towards increasingly entangled states characterized by an extensive scaling of entanglement entropy with system volume. At the other extreme, quantum systems repeatedly…
Quantum variational optimization has been posed as an alternative to solve optimization problems faster and at a larger scale than what classical methods allow. In this paper we study systematically the role of entanglement, the structure…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
Calibrating the role of entanglement in quantum algorithms is a crucial task in the development of quantum computing. Most existing studies have primarily focused on how the static properties of entanglement-such as its magnitude and…
Variational quantum algorithms (VQAs) represent a promising pathway toward achieving practical quantum advantage on near-term hardware. Despite this promise, for generic, expressive ans\"atze, their scalability is critically hindered by…
We introduce and explore a one-dimensional "hybrid" quantum circuit model consisting of both unitary gates and projective measurements. While the unitary gates are drawn from a random distribution and act uniformly in the circuit, the…
Variational quantum algorithms (VQAs) promise efficient use of near-term quantum computers. However, training VQAs often requires an extensive amount of time and suffers from the barren plateau problem where the magnitude of the gradients…
In this paper we continue to explore "hybrid" quantum circuit models in one-dimension with both unitary and measurement gates, focussing on the entanglement properties of wavefunction trajectories at long times, in the steady state. We…
When subject to a non-local unitary evolution, qubits in a quantum circuit become increasingly entangled. Conversely, measurements applied to individual qubits lead to their disentanglement from the collective system. The extent of…