A graph-state based synthesis framework for Clifford isometries

• URL: http://arxiv.org/abs/2212.06928v1
• Date: Tue, 13 Dec 2022 22:50:24 GMT
• Title: A graph-state based synthesis framework for Clifford isometries
• Authors: Timoth\'ee Goubault de Brugi\`ere, Simon Martiel and Christophe Vuillot
• Abstract summary: We tackle the problem of synthesizing a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that exploits the elementary properties of the Clifford group and one equation of the symplectic group. We report an improvement of the two-qubit depth necessary for the execution of a Clifford circuit on an LNN architecture.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford group and one equation of the symplectic group. We highlight the versatility of our framework by showing that several normal forms of the literature are natural corollaries. We report an improvement of the two-qubit depth necessary for the execution of a Clifford circuit on an LNN architecture. We also apply our framework to the synthesis of graph states and the codiagonalization of Pauli rotations and we improve the 2-qubit count and 2-qubit depth of circuits taken from quantum chemistry experiments.

Related papers

• QuCLEAR: Clifford Extraction and Absorption for Significant Reduction in Quantum Circuit Size [8.043057448895343]
  Currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits. We present QuCLEAR, a compilation framework designed to optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-08-23T18:03:57Z)
• Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
  Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
  arXiv  Detail & Related papers  (2024-06-17T20:48:43Z)
• A T-depth two Toffoli gate for 2D square lattice architectures [49.88310438099143]
  We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures.
  arXiv  Detail & Related papers  (2023-11-21T10:33:51Z)
• Efficient Classical Simulation of Clifford Circuits from Framed Wigner Functions [4.282159812965446]
  Wigner function formalism serves as crucial tool for simulating continuous-variable and odd-prime dimensional quantum circuits. We introduce a novel classical simulation method for non-adaptive Clifford circuits based on the framed Wigner function.
  arXiv  Detail & Related papers  (2023-07-31T14:02:33Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers [4.208975913508643]
  Optimal synthesis is a central problem in both quantum and classical hardware design. We use entangling input stimuli and the stabilizer formalism to reduce the Clifford synthesis problem to a family of poly-size satisfiability problems. Empirical evaluations show that the optimal synthesis approach yields a substantial depth improvement for random Clifford circuits and Clifford+T circuits for Grover search.
  arXiv  Detail & Related papers  (2023-05-02T18:00:00Z)
• Geometric Clifford Algebra Networks [53.456211342585824]
  We propose Geometric Clifford Algebra Networks (GCANs) for modeling dynamical systems. GCANs are based on symmetry group transformations using geometric (Clifford) algebras.
  arXiv  Detail & Related papers  (2023-02-13T18:48:33Z)
• Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis [0.30458514384586405]
  We consider models of entanglement-assisted computation where long-range operations are achieved through injections of large GHZ states. We derive bounds on the circuit size for several well studied problems, such as CZ circuit, CX circuit, and Clifford circuit synthesis.
  arXiv  Detail & Related papers  (2023-02-13T17:29:08Z)
• MuSCLE: Multi Sweep Compression of LiDAR using Deep Entropy Models [78.93424358827528]
  We present a novel compression algorithm for reducing the storage streams of LiDAR sensor data. Our method significantly reduces the joint geometry and intensity over prior state-of-the-art LiDAR compression methods.
  arXiv  Detail & Related papers  (2020-11-15T17:41:14Z)
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
  We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
  arXiv  Detail & Related papers  (2020-07-20T22:26:16Z)
• Hadamard-free circuits expose the structure of the Clifford group [9.480212602202517]
  The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. We show that any Clifford operator can be uniquely written in the canonical form $F_HSF$. A surprising connection is highlighted between random uniform Clifford operators and the Mallows distribution on the symmetric group.
  arXiv  Detail & Related papers  (2020-03-20T17:51:36Z)

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.