A Rubik's Cube inspired approach to Clifford synthesis

• URL: http://arxiv.org/abs/2307.08684v2
• Date: Mon, 13 Nov 2023 19:46:19 GMT
• Title: A Rubik's Cube inspired approach to Clifford synthesis
• Authors: Ning Bao and Gavin S. Hartnett
• Abstract summary: The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. We develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity.
• Score: 0.14504054468850663
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The problem of decomposing an arbitrary Clifford element into a sequence of Clifford gates is known as Clifford synthesis. Drawing inspiration from similarities between this and the famous Rubik's Cube problem, we develop a machine learning approach for Clifford synthesis based on learning an approximation to the distance to the identity. This approach is probabilistic and computationally intensive. However, when a decomposition is successfully found, it often involves fewer gates than existing synthesis algorithms. Additionally, our approach is much more flexible than existing algorithms in that arbitrary gate sets, device topologies, and gate fidelities may incorporated, thus allowing for the approach to be tailored to a specific device.

Related papers

• Knowledge-aware equation discovery with automated background knowledge extraction [50.79602839359522]
  We describe an algorithm that allows the discovery of unknown equations using automatically or manually extracted background knowledge. In this way, we mimic expertly chosen terms while preserving the possibility of obtaining any equation form. The paper shows that the extraction and use of knowledge allows it to outperform the SINDy algorithm in terms of search stability and robustness.
  arXiv  Detail & Related papers  (2024-12-31T13:51:31Z)
• Learning Gaussian Operations and the Matchgate Hierarchy [0.0]
  We introduce an infinite family of unitary gates, called the Matchgate Hierarchy, with a similar structure to the Clifford Hierarchy. We show that the Clifford Hierarchy is contained within the Matchgate Hierarchy and how operations at any level of the hierarchy can be efficiently learned.
  arXiv  Detail & Related papers  (2024-07-17T15:22:58Z)
• 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)
• Multi-Phase Relaxation Labeling for Square Jigsaw Puzzle Solving [73.58829980121767]
  We present a novel method for solving square jigsaw puzzles based on global optimization. The method is fully automatic, assumes no prior information, and can handle puzzles with known or unknown piece orientation.
  arXiv  Detail & Related papers  (2023-03-26T18:53:51Z)
• A graph-state based synthesis framework for Clifford isometries [2.048226951354646]
  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 also propose practical synthesis algorithms for Clifford isometries with a focus on Clifford operators, graph states and codiagonalization of Pauli rotations.
  arXiv  Detail & Related papers  (2022-12-13T22:50:24Z)
• A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
  Faults are by nature while most man-made systems, and especially computers, work deterministically. This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
  arXiv  Detail & Related papers  (2022-09-08T17:55:30Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Decomposition of Clifford Gates [3.7900158137749322]
  We provide a fast algorithm that decomposes any Clifford gate as a $textitminimal$ product of Clifford transvections. The algorithm can be directly used for finding all Pauli matrices that commute with any given Clifford gate.
  arXiv  Detail & Related papers  (2021-02-05T10:32:09Z)
• 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.