Reducing entanglement with a Hamiltonian derived Clifford transformation

• URL: http://arxiv.org/abs/2607.18404v1
• Date: Mon, 20 Jul 2026 18:00:40 GMT
• Title: Reducing entanglement with a Hamiltonian derived Clifford transformation
• Abstract summary: Recently, an algorithm was introduced that deterministically generates a Clifford transformation from the Qubit Coupled Cluster (QCC) algorithm.<n>Here, we show that Q-Cliff can be utilized to generate efficient classical and quantum approximations to the ground states of chemical systems.
• Score: 37.803764941926374
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recently (Physica Scripta, 100(10):105401, 2025), an algorithm was introduced that deterministically generates a Clifford transformation from the Qubit Coupled Cluster (QCC) algorithm which we call Q-Cliff (QCC+Clifford). There, it was shown that Q-Cliff could be utilized to generate a hardware efficient version of the QCC ansatz. Here, we examine and refine these techniques and show that Q-Cliff can be utilized to generate efficient classical and quantum approximations to the ground states of chemical systems. The algorithm generates an efficient variational method that generally has accuracy between MP2 and CISD with $O(N^6)$. Furthermore, we show through DMRG calculations that the entanglement between qubits is reduced significantly and therefore the accuracy for a given bond dimension can be vastly improved (up to an order of magnitude). Finally, we refine the previously reported algorithm to generate low-depth and CNOT efficient circuits that can be optimized with a comparable number of energy evaluations to state-of-the-art VQE algorithms. All these results show that this Hamiltonian derived Clifford transformation should be a tool used for many classical and quantum algorithms.

Related papers

• Augmenting Density Matrix Renormalization Group with Matchgates and Clifford circuits [1.6249398255272316]
  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.
  arXiv  Detail & Related papers  (2025-05-13T14:53:09Z)
• Optimization of the Qubit Coupled Cluster Ansatz on classical computers [0.0]
  We report two schemes for improving the amplitude optimisation in the iterative qubit coupled cluster (iQCC) method.<n>First scheme approximates the QCC unitary as a sum of generators coupled up to a given order.<n>Second scheme limits the size of the expansion space in which the QCC unitary is generated.
  arXiv  Detail & Related papers  (2025-02-24T19:11:40Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
  We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets. Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
  arXiv  Detail & Related papers  (2024-02-22T09:20:54Z)
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization [41.94295877935867]
  We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm. Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors. We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-08-29T17:53:08Z)
• 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)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• 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)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• 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)

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.