Augmenting Density Matrix Renormalization Group with Matchgates and Clifford circuits

• URL: http://arxiv.org/abs/2505.08635v1
• Date: Tue, 13 May 2025 14:53:09 GMT
• Title: Augmenting Density Matrix Renormalization Group with Matchgates and Clifford circuits
• Authors: Jiale Huang, Xiangjian Qian, Zhendong Li, Mingpu Qin,
• Abstract summary: We propose a new wave-function ansatz in which matrix product states are augmented with the combination of Matchgates and Clifford circuits (dubbed MCA-MPS)<n>Our benchmark results on one-dimensional hydrogen chain show that MCA-MPS can improve the accuracy of the ground-state calculation by several orders of magnitude over MPS with the same bond dimension.
• Score: 1.6249398255272316
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Matchgates and Clifford circuits are two types of quantum circuits which can be efficiently simulated classically, though the underlying reasons are quite different. Matchgates are essentially the single particle basis transformations in the Majorana fermion representation which can be easily handled classically, while the Clifford circuits can be efficiently simulated using the tableau method according to the Gottesman-Knill theorem. In this work, we propose a new wave-function ansatz in which matrix product states are augmented with the combination of Matchgates and Clifford circuits (dubbed MCA-MPS) to take advantage of the representing power of all of them. Moreover, the optimization of MCA-MPS can be efficiently implemented within the Density Matrix Renormalization Group method. Our benchmark results on one-dimensional hydrogen chain show that MCA-MPS can improve the accuracy of the ground-state calculation by several orders of magnitude over MPS with the same bond dimension. This new method provides us a useful approach to study quantum many-body systems. The MCA-MPS ansatz also expands our understanding of classically simulatable quantum many-body states.

Related papers

• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement [0.0]
  We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS)<n>Our algorithm represents a near-term alternative to previous sequential approaches by reverse application of a disentangler.<n>We show numerical results for ground states of one-dimensional, local Hamiltonians as well as artificially spread out entanglement among multiple qubits.
  arXiv  Detail & Related papers  (2025-04-30T04:13:01Z)
• Disentangling unitary dynamics with classically simulable quantum circuits [0.0]
  We study both quantum circuit and Hamiltonian dynamics. We find that expectations of Pauli operators can be simulated efficiently even for deep Clifford circuits. For the Hamiltonian dynamics we find that the classical simulation generically quickly becomes inefficient.
  arXiv  Detail & Related papers  (2024-10-11T17:18:26Z)
• QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit Optimization [8.043057448895343]
  Currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits.<n>We present QuCLEAR, a compilation framework designed to optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-08-23T18:03:57Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
  Current quantum computing hardware is restricted by the availability of only few, noisy qubits. We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
  arXiv  Detail & Related papers  (2023-03-02T13:05:19Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Riemannian quantum circuit optimization for Hamiltonian simulation [2.1227079314039057]
  Hamiltonian simulation is a natural application of quantum computing. For translation invariant systems, the gates in such circuit topologies can be further optimized on classical computers. For the Ising and Heisenberg models on a one-dimensional lattice, we achieve orders of magnitude accuracy improvements.
  arXiv  Detail & Related papers  (2022-12-15T00:00:17Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Quadratic Clifford expansion for efficient benchmarking and initialization of variational quantum algorithms [0.8808007156832224]
  Variational quantum algorithms are considered to be appealing applications of near-term quantum computers. We propose a perturbative approach for efficient benchmarking of variational quantum algorithms.
  arXiv  Detail & Related papers  (2020-11-19T16:09:00Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)

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.