From Entanglement to Universality: A Multiparticle Spacetime Algebra Approach to Quantum Computational Gates Revisited

• URL: http://arxiv.org/abs/2405.08152v2
• Date: Wed, 12 Jun 2024 12:16:21 GMT
• Title: From Entanglement to Universality: A Multiparticle Spacetime Algebra Approach to Quantum Computational Gates Revisited
• Authors: Carlo Cafaro, Newshaw Bahreyni, Leonardo Rossetti,
• Abstract summary: We focus on testing the usefulness of geometric algebras (GAs) techniques in two applications to quantum computing. First, we offer an explicit algebraic characterization of one- and two-qubit quantum states together with a MSTA description of one- and two-qubit quantum computational gates. In this first application, we devote special attention to the concept of entanglement, focusing on entangled quantum states and two-qubit entangling quantum gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Alternative mathematical explorations in quantum computing can be of great scientific interest, especially if they come with penetrating physical insights. In this paper, we present a critical revisitation of our geometric (Clifford) algebras (GAs) application in quantum computing as originally presented in [C. Cafaro and S. Mancini, Adv. Appl. Clifford Algebras 21, 493 (2011)]. Our focus is on testing the usefulness of geometric algebras (GAs) techniques in two applications to quantum computing. First, making use of the geometric algebra of a relativistic configuration space (a.k.a., multiparticle spacetime algebra or MSTA), we offer an explicit algebraic characterization of one- and two-qubit quantum states together with a MSTA description of one- and two-qubit quantum computational gates. In this first application, we devote special attention to the concept of entanglement, focusing on entangled quantum states and two-qubit entangling quantum gates. Second, exploiting the previously mentioned MSTA characterization together with the GA depiction of the Lie algebras SO(3;R) and SU(2;C) depending on the rotor group formalism, we focus our attention to the concept of universality in quantum computing by reevaluating Boykin's proof on the identification of a suitable set of universal quantum gates. At the end of our mathematical exploration, we arrive at two main conclusions. Firstly, the MSTA perspective leads to a powerful conceptual unification between quantum states and quantum operators. More specifically, the complex qubit space and the complex space of unitary operators acting on them merge in a single multivectorial real space. Secondly, the GA viewpoint on rotations based on the rotor group carries both conceptual and computational upper hands compared to conventional vectorial and matricial methods.

Related papers

• A direct approach to coherent states of billiards using a quantum algebra framework [0.0]
  We apply the Generalized Heisenberg Algebra to quantum billiards, showcasing its application to separable and non-separable billiards. We generate one-dimensional coherent states with specific quantum numbers and explore their time evolution. We also demonstrate its applicability in a non-separable equilateral triangle billiard, describing their algebra generators and associated one-dimensional coherent states.
  arXiv  Detail & Related papers  (2024-09-11T16:18:45Z)
• Quantum channels, complex Stiefel manifolds, and optimization [45.9982965995401]
  We establish a continuity relation between the topological space of quantum channels and the quotient of the complex Stiefel manifold. The established relation can be applied to various quantum optimization problems.
  arXiv  Detail & Related papers  (2024-08-19T09:15:54Z)
• Diagonalization of large many-body Hamiltonians on a quantum processor [28.65071920454694]
  We use a superconducting quantum processor to compute eigenenergies of quantum many-body systems on two-dimensional lattices of up to 56 sites. We construct subspaces of the many-body Hilbert space using Trotterized unitary evolutions executed on the quantum processor.
  arXiv  Detail & Related papers  (2024-07-19T16:02:03Z)
• Quantum computing topological invariants of two-dimensional quantum matter [0.0]
  We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers. First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits. Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
  arXiv  Detail & Related papers  (2024-04-09T06:22:50Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information [0.9208007322096533]
  We study representation theory of the partially transposed permutation matrix algebra. We show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels. We derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol.
  arXiv  Detail & Related papers  (2023-10-03T17:55:10Z)
• Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis [31.203764035373677]
  We develop Quantivine, an interactive system for exploring and understanding quantum circuits. A series of novel circuit visualizations are designed to uncover contextual details such as qubit provenance, parallelism, and entanglement. The effectiveness of Quantivine is demonstrated through two usage scenarios of quantum circuits with up to 100 qubits.
  arXiv  Detail & Related papers  (2023-07-18T04:51:28Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Geometric and holonomic quantum computation [1.4644151041375417]
  Quantum gates based on geometric phases and quantum holonomies possess built-in resilience to certain kinds of errors. This review provides an introduction to the topic as well as gives an overview of the theoretical and experimental progress for constructing geometric and holonomic quantum gates.
  arXiv  Detail & Related papers  (2021-10-07T16:31:54Z)
• 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)

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.