Quantum Register Algebra: the mathematical language for quantum computing

• URL: http://arxiv.org/abs/2208.02608v1
• Date: Thu, 4 Aug 2022 12:13:34 GMT
• Title: Quantum Register Algebra: the mathematical language for quantum computing
• Abstract summary: We introduce Quantum Register Algebra (QRA) as an efficient tool for quantum computing. We show the direct link between QRA and Dirac formalism.
• Score: 0.7588690078299699
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce Quantum Register Algebra (QRA) as an efficient tool for quantum computing. We show the direct link between QRA and Dirac formalism. We present GAALOP (Geometric Algebra Algorithms Optimizer) implementation of our approach. Using the QRA basis vectors definitions given in Section 4 and the framework based on the de Witt basis presented in Section 5, we are able to fully describe and compute with QRA in GAALOP using the geometric product. We illustrate the intuitiveness of this computation by presenting the QRA form for the well known SWAP operation on a two qubit register.

Related papers

• Quantum Computing Algebra (QCA), the theory and implementation [0.2249916681499244]
  We present a real geometric algebra framework designed for the direct translation of the Dirac formalism into geometric algebra representations.<n>We show how quantum gates and multi-qubit systems can be efficiently represented and generated computationally.
  arXiv  Detail & Related papers  (2026-06-16T07:27:40Z)
• Quantum Hyperdimensional Computing: a foundational paradigm for quantum neuromorphic architectures [0.5785414922972825]
  We introduce Quantum Hyperdimensional Computing (QHDC), a fundamentally new paradigm.<n>We demonstrate that the core operations of its classical counterpart, Hyperdimensional Computing (HDC), map with remarkable elegance and direct correspondence onto the native operations of a QC.<n>We present the first-ever implementation of this framework, validated through symbolic analogical reasoning and supervised classification tasks.
  arXiv  Detail & Related papers  (2025-11-16T16:01:56Z)
• Efficient Quantum State Preparation with Bucket Brigade QRAM [47.72095699729477]
  Preparation of data in quantum states is a critical component in the design of quantum algorithms.<n>One of the main approaches to achieve efficient state preparation is through the use of Quantum Random Access Memory (QRAM)<n>We present a framework that integrates the physical model of the Bucket Brigade QRAM (BBQRAM) with the classical data structure of the Segment Tree to achieve efficient state preparation.
  arXiv  Detail & Related papers  (2025-10-17T18:50:07Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• From Entanglement to Universality: A Multiparticle Spacetime Algebra Approach to Quantum Computational Gates Revisited [0.0]
  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.
  arXiv  Detail & Related papers  (2024-05-13T19:51:26Z)
• 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)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Three-qubit Deutsch-Jozsa in measurement-based quantum computing [0.0]
  Measurement-based quantum computing (MBQC) is an alternate paradigm for formulating quantum algorithms. We describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. We derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch-Jozsa algorithm.
  arXiv  Detail & Related papers  (2023-06-23T08:53:11Z)
• Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform [0.0]
  We present a transparent algorithm for implementing the qubit quantum Schur transform. We study the associated Schur states, which consist of qubits coupled via Clebsch-Gordan coefficients. It is shown that Wigner 6-j symbols and SU(N) Clebsch-Gordan coefficients naturally fit our framework.
  arXiv  Detail & Related papers  (2023-05-06T15:19:52Z)
• 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)
• Quantum Machine Learning using the ZXW-Calculus [0.0]
  We use the ZXW-calculus to diagrammatically analyse two key problems that quantum machine learning applications face. First, we discuss algorithms to compute gradients on quantum hardware that are needed to perform gradient-based optimisation for QML. Secondly, we analyse the gradient landscape of quantum ans"atze for barren plateaus using both empirical and analytical techniques.
  arXiv  Detail & Related papers  (2022-10-18T22:33:41Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Quantum computing based on complex Clifford algebras [0.0]
  We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of $2n.$ We demonstrate its functionality by performing quantum computations with several well known examples of quantum gates.
  arXiv  Detail & Related papers  (2022-01-06T21:01:29Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)

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.