Maximising Quantum-Computing Expressive Power through Randomised Circuits

• URL: http://arxiv.org/abs/2312.01947v1
• Date: Mon, 4 Dec 2023 15:04:42 GMT
• Title: Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Authors: Yingli Yang, Zongkang Zhang, Anbang Wang, Xiaosi Xu, Xiaoting Wang, Ying Li
• Abstract summary: variational quantum algorithms (VQAs) have emerged as a promising avenue to obtain quantum advantage. We numerically demonstrate a novel approach for VQAs, utilizing randomised quantum circuits to generate the variational wavefunction. This random-circuit approach presents a trade-off between the expressive power of the variational wavefunction and time cost.
• Score: 4.604271571912073
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Learning the expressibility of quantum circuit ansatz using transformer [5.368973814856243]
  We propose using a transformer model to predict the expressibility of quantum circuit ansatze. This research can enhance the understanding of the expressibility of quantum circuit ansatze and advance quantum architecture search algorithms.
  arXiv  Detail & Related papers  (2024-05-29T07:34:07Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Quantum gradient evaluation through quantum non-demolition measurements [0.0]
  We discuss a Quantum Non-Demolition Measurement protocol to estimate the derivatives of a cost function with a quantum computer. This is a key step for the implementation of variational quantum circuits.
  arXiv  Detail & Related papers  (2023-01-17T19:00:08Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• A variational quantum eigensolver for dynamic correlation functions [0.9176056742068814]
  We show how the calculation of zero-temperature dynamic correlation functions can be recast into a modified VQE algorithm. This allows for important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis. We believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.
  arXiv  Detail & Related papers  (2021-05-04T18:52:45Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Variational Quantum Algorithms for Steady States of Open Quantum Systems [2.740982822457262]
  We propose a variational quantum algorithm to find the steady state of open quantum systems. The fidelity between the optimal mixed state and the true steady state is over 99%. This algorithm is derived from the natural idea of expressing mixed states with purification.
  arXiv  Detail & Related papers  (2020-01-08T14:47:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.