A sequentially generated variational quantum circuit with polynomial complexity

• URL: http://arxiv.org/abs/2305.12856v1
• Date: Mon, 22 May 2023 09:30:36 GMT
• Title: A sequentially generated variational quantum circuit with polynomial complexity
• Authors: Xiaokai Hou, Qingyu Li, Man-Hong Yung, Xusheng Xu, Zizhu Wang, Chu Guo and Xiaoting Wang
• Abstract summary: In this work, we propose a sequentially generated circuit ansatz, which naturally adapts to 1D, 2D, 3D quantum many-body problems. As applications, we demonstrate that our ansatz can be used to accurately reconstruct unknown pure and mixed quantum states.
• Score: 0.46180371154032895
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational quantum algorithms have been a promising candidate to utilize near-term quantum devices to solve real-world problems. The powerfulness of variational quantum algorithms is ultimately determined by the expressiveness of the underlying quantum circuit ansatz for a given problem. In this work, we propose a sequentially generated circuit ansatz, which naturally adapts to 1D, 2D, 3D quantum many-body problems. Specifically, in 1D our ansatz can efficiently generate any matrix product states with a fixed bond dimension, while in 2D our ansatz generates the string-bond states. As applications, we demonstrate that our ansatz can be used to accurately reconstruct unknown pure and mixed quantum states which can be represented as matrix product states, and that our ansatz is more efficient compared to several alternatives in finding the ground states of some prototypical quantum many-body systems as well as quantum chemistry systems, in terms of the number of quantum gate operations.

Related papers

• A Quantum Approximate Optimization Method For Finding Hadamard Matrices [0.0]
  We propose a novel qubit-efficient method by implementing the Hadamard matrix searching algorithm on a gate-based quantum computer. We present the formulation of the method, construction of corresponding quantum circuits, and experiment results in both a quantum simulator and a real gate-based quantum computer.
  arXiv  Detail & Related papers  (2024-08-15T06:25:50Z)
• Diamond-shaped quantum circuit for real-time quantum dynamics in one dimension [0.0]
  We show that quantum many-body states can be universally represented using a quantum circuit comprising multi-qubit gates. We also evaluate the efficiency of a quantum circuit constructed with two-qubit gates in quench dynamics for the transverse-field Ising model. Our results reveal that a diamond-shaped quantum circuit, designed to approximate the multi-qubit gate-based quantum circuit, remarkably excels in accurately representing the long-time dynamics of the system.
  arXiv  Detail & Related papers  (2023-11-10T07:07:54Z)
• Quantum Signal Processing with the one-dimensional quantum Ising model [0.0]
  Quantum Signal Processing (QSP) has emerged as a promising framework to manipulate and determine properties of quantum systems. We provide examples and applications of our approach in diverse fields ranging from space-time dual quantum circuits and quantum simulation, to quantum control.
  arXiv  Detail & Related papers  (2023-09-08T18:01:37Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Variational Quantum Linear Solver with Dynamic Ansatz [0.0]
  Variational quantum algorithms have found success in the NISQ era owing to their hybrid quantum-classical approach. We introduce the dynamic ansatz in the Variational Quantum Linear Solver for a system of linear algebraic equations. We demonstrate the algorithm advantage in comparison to the standard, static ansatz by utilizing fewer quantum resources.
  arXiv  Detail & Related papers  (2021-07-19T03:42:25Z)
• Adiabatic Quantum Graph Matching with Permutation Matrix Constraints [75.88678895180189]
  Matching problems on 3D shapes and images are frequently formulated as quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. We propose several reformulations of QAPs as unconstrained problems suitable for efficient execution on quantum hardware. The proposed algorithm has the potential to scale to higher dimensions on future quantum computing architectures.
  arXiv  Detail & Related papers  (2021-07-08T17:59:55Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.