Low-Depth Unitary Coupled Cluster Theory for Quantum Computation

• URL: http://arxiv.org/abs/2109.14134v1
• Date: Wed, 29 Sep 2021 01:47:56 GMT
• Title: Low-Depth Unitary Coupled Cluster Theory for Quantum Computation
• Abstract summary: unitary coupled cluster (UCC) approximation is promising wave-function ans"atze for electronic structure calculations on quantum computers. For large systems with many orbitals, the required number of UCC factors still leads to very deep quantum circuits. We devise an algorithm that employs a Taylor expansion in the small amplitudes, trading off circuit depth for extra measurements.
• Score: 6.960453648000231
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The unitary coupled cluster (UCC) approximation is one of the more promising wave-function ans\"atze for electronic structure calculations on quantum computers via the variational quantum eigensolver algorithm. However, for large systems with many orbitals, the required number of UCC factors still leads to very deep quantum circuits, which can be challenging to implement. Based on the observation that most UCC amplitudes are small for weakly correlated molecules, we devise an algorithm that employs a Taylor expansion in the small amplitudes, trading off circuit depth for extra measurements. Strong correlations can be taken into account by performing the expansion about a small set of UCC factors, which are treated exactly. Near equilibrium, the Taylor series expansion often works well without the need to include any exact factors; as the molecule is stretched and correlations increase, we find only a small number of factors need to be treated exactly.

Related papers

• Low Depth Unitary Coupled Cluster Algorithm for Large Chemical Systems [0.0]
  unitary coupled cluster (UCC) algorithm is one of the most promising implementations of variational quantum eigensolver for quantum computers.<n>For large systems, the number of UCC factors leads to deep quantum circuits, which are prohibitive for execution on quantum hardware.<n>We implement this approach to quadratic order (qUCC) for systems with strong correlations and systems where conventional methods like coupled cluster (CC) with low excitation levels fail.
  arXiv  Detail & Related papers  (2026-02-16T18:28:50Z)
• When Less is More: Approximating the Quantum Geometric Tensor with Block Structures [43.39839287869652]
  We introduce a block-diagonal quantum geometric tensor that partitions the metric by network layers, analogous to block-structured Fisher methods such as K-FAC.<n> Experiments on Heisenberg and frustrated $J_1$-$J$ models show faster convergence, lower energy, and improved stability.
  arXiv  Detail & Related papers  (2025-10-09T16:44:30Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques [0.0]
  This work demonstrates how to reduce circuit depth by combining the transcorrelated (TC) approach with adaptive quantum ans"atze. Our study demonstrates that combining the TC method with adaptive ans"atze yields compact, noise-resilient, and easy-to-optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-02-26T15:31:56Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Computing Electronic Correlation Energies using Linear Depth Quantum Circuits [0.0]
  We demonstrate a variational NISQ-friendly algorithm that generates a set of mean-field Hartree-Fock ansatzes. We tested the algorithm on several small molecules, both with classical simulations and on cloud quantum processors. As fidelities of quantum processors continue to improve our algorithm will enable the study of larger molecules.
  arXiv  Detail & Related papers  (2022-07-08T15:08:30Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Localized Quantum Chemistry on Quantum Computers [0.6649973446180738]
  Quantum chemistry calculations are typically limited by the computation cost that scales exponentially with the size of the system. We present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation.
  arXiv  Detail & Related papers  (2022-03-03T20:52:22Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting [3.0998962250161783]
  Quantum computation represents a revolutionary approach for solving problems in quantum chemistry. Due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large chemical systems remains a major task. In this work, we demonstrate that the circuit depth of the unitary coupled cluster (UCC) and UCC-based ansatzes can be significantly reduced by an energy-sorting strategy.
  arXiv  Detail & Related papers  (2021-06-29T09:51:19Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• A posteriori corrections to the Iterative Qubit Coupled Cluster method to minimize the use of quantum resources in large-scale calculations [0.0]
  We present a variety of a posteriori corrections to the iQCC energies to reduce the number of iterations to achieve the desired accuracy. We demonstrate the utility and efficiency of our approach numerically on the examples of 10-qubit N$$ molecule, the 24-qubit H$$O stretch, and 56-qubit singlet-triplet gap calculations.
  arXiv  Detail & Related papers  (2020-09-28T20:57:32Z)

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.