A Quantum Computing View on Unitary Coupled Cluster Theory

• URL: http://arxiv.org/abs/2109.15176v2
• Date: Thu, 3 Mar 2022 03:42:40 GMT
• Title: A Quantum Computing View on Unitary Coupled Cluster Theory
• Authors: Abhinav Anand, Philipp Schleich, Sumner Alperin-Lea, Phillip W. K. Jensen, Sukin Sim, Manuel D\'iaz-Tinoco, Jakob S. Kottmann, Matthias Degroote, Artur F. Izmaylov and Al\'an Aspuru-Guzik
• Abstract summary: Unitary Coupled Cluster (UCC) ansatz and related ans"atze are used to variationally solve the electronic structure problem on quantum computers. The review concludes with a unified perspective on the discussed ans"atze, attempting to bring them under a common framework.
• Score: 0.39323007669342247
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a review of the Unitary Coupled Cluster (UCC) ansatz and related ans\"atze which are used to variationally solve the electronic structure problem on quantum computers. A brief history of coupled cluster (CC) methods is provided, followed by a broad discussion of the formulation of CC theory. This includes touching on the merits and difficulties of the method and several variants, UCC among them, in the classical context, to motivate their applications on quantum computers. In the core of the text, the UCC ansatz and its implementation on a quantum computer are discussed at length, in addition to a discussion on several derived and related ans\"atze specific to quantum computing. The review concludes with a unified perspective on the discussed ans\"atze, attempting to bring them under a common framework, as well as with a reflection upon open problems within the field.

Related papers

• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Coupled cluster downfolding techniques: a review of existing applications in classical and quantum computing for chemical systems [5.774827369850958]
  We provide an overview of the recent developments of the coupled cluster (CC) downfolding methods. We emphasize the important role of downfolding formalisms in transitioning chemical applications from noisy quantum devices to scalable and error-corrected quantum computers.
  arXiv  Detail & Related papers  (2023-02-28T21:16:26Z)
• 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)
• Quantum Computational Complexity -- From Quantum Information to Black Holes and Back [0.0]
  Quantum computational complexity was suggested as a new entry in the holographic dictionary. We show how it can be used to define complexity for generic quantum systems. We highlight the relation between complexity, chaos and scrambling in chaotic systems.
  arXiv  Detail & Related papers  (2021-10-27T18:00:12Z)
• A thorough introduction to non-relativistic matrix mechanics in multi-qudit systems with a study on quantum entanglement and quantum quantifiers [0.0]
  This article provides a deep and abiding understanding of non-relativistic matrix mechanics. We derive and analyze the respective 1-qubit, 1-qutrit, 2-qubit, and 2-qudit coherent and incoherent density operators. We also address the fundamental concepts of quantum nondemolition measurements, quantum decoherence and, particularly, quantum entanglement.
  arXiv  Detail & Related papers  (2021-09-14T05:06:47Z)
• 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)
• Testing Quantum Contextuality of Binary Symplectic Polar Spaces on a Noisy Intermediate Scale Quantum Computer [0.0]
  Noisy Intermediate Scale Quantum Computers (NISQC) provides for the Quantum Information community new tools to perform quantum experiences from an individual laptop. It facilitates interdisciplinary research in the sense that theoretical descriptions of properties of quantum physics can be translated to experiments easily implementable on a NISCQ.
  arXiv  Detail & Related papers  (2021-01-11T10:55:34Z)
• Algebraic Quantum Codes: Linking Quantum Mechanics and Discrete Mathematics [0.6091702876917279]
  We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space. We illustrate how QECCs can be constructed using techniques from algebraic coding theory. We discuss secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs.
  arXiv  Detail & Related papers  (2020-11-13T16:25:31Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.