Maximising Quantum-Computing Expressive Power through Randomised Circuits

Abstract

In the noisy intermediate-scale quantum era, variational quantum algorithms (VQAs) have emerged as a promising avenue to obtain quantum advantage. However, the success of VQAs depends on the expressive power of parameterised quantum circuits, which is constrained by the limited gate number and the presence of barren plateaus. In this work, we propose and numerically demonstrate a novel approach for VQAs, utilizing randomised quantum circuits to generate the variational wavefunction. We parameterize the distribution function of these random circuits using artificial neural networks and optimize it to find the solution. This random-circuit approach presents a trade-off between the expressive power of the variational wavefunction and time cost, in terms of the sampling cost of quantum circuits. Given a fixed gate number, we can systematically increase the expressive power by extending the quantum-computing time. With a sufficiently large permissible time cost, the variational wavefunction can approximate any quantum state with arbitrary accuracy. Furthermore, we establish explicit relationships between expressive power, time cost, and gate number for variational quantum eigensolvers. These results highlight the promising potential of the random-circuit approach in achieving a high expressive power in quantum computing.

arXiv comment19 pages, 10 figures

References in corpus (58)

• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• Quantum machine learning in feature Hilbert spaces
• Quantum Circuit Learning
• Quantum Convolutional Neural Networks
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Circuit-centric quantum classifiers
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Scalable Quantum Simulation of Molecular Energies
• Towards Practical Quantum Variational Algorithms
• Efficient Learning for Deep Quantum Neural Networks
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Efficient variational quantum simulator incorporating active error minimisation
• Data re-uploading for a universal quantum classifier
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Deep neural network solution of the electronic Schrödinger equation
• Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks
• Variational Quantum Computation of Excited States
• Theory of variational quantum simulation
• Universal Quantum Estimator
• Direct estimations of linear and non-linear functionals of a quantum state
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• The Expressive Power of Parameterized Quantum Circuits
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Subspace-search variational quantum eigensolver for excited states
• Variational quantum simulation of general processes
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Structure optimization for parameterized quantum circuits
• Variational algorithms for linear algebra
• Backflow Transformations via Neural Networks for Quantum Many-Body Wave-Functions
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Large gradients via correlation in random parameterized quantum circuits
• Entanglement Devised Barren Plateau Mitigation
• A Non-Orthogonal Variational Quantum Eigensolver
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Algorithms for quantum simulation at finite energies
• Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
• Expressibility of the alternating layered ansatz for quantum computation
• The Variational Power of Quantum Circuit Tensor Networks
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms
• Error mitigation via verified phase estimation
• Reinforcement Learning assisted Quantum Optimization
• Towards the ground state of molecules via diffusion Monte Carlo on neural networks
• Expressibility and trainability of parameterized analog quantum systems for machine learning applications
• Quantum algorithms for grid-based variational time evolution
• Quantum-assisted Monte Carlo algorithms for fermions
• Enhancing variational Monte Carlo using a programmable quantum simulator