Measurement-Based Quantum Compiling via Gauge Invariance

• URL: http://arxiv.org/abs/2411.12485v1
• Date: Tue, 19 Nov 2024 13:09:49 GMT
• Title: Measurement-Based Quantum Compiling via Gauge Invariance
• Authors: Sebastiano Corli, Enrico Prati,
• Abstract summary: We introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.
• Score: 1.1510009152620668
• License:
• Abstract: The measurement-based architecture is a paradigm of quantum computing, relying on the entanglement of a cluster of qubits and the measurements of a subset of it, conditioning the state of the unmeasured output qubits. While methods to map the gate model circuits into the measurement-based are already available via intermediate steps, we introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. Such method relies on the stabilizer formalism to describe the register of the input qubits. An equivalence class between graph states able to implement the same circuit is defined, giving rise to a gauge freedom when compiling in the MBQC frame. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. A system of equations describes the overall process. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.

Related papers

• Dynamical weight reduction of Pauli measurements [0.0]
  We formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight. We highlight three examples that achieve a constant time or a constant space overhead. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams.
  arXiv  Detail & Related papers  (2024-10-16T13:03:33Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• Graphix: optimizing and simulating measurement-based quantum computation on local-Clifford decorated graph [0.0]
  We introduce an open-source software library Graphix, which optimize and simulates measurement-based quantum computation (MBQC) By combining the measurement calculus with an efficient graph state simulator, Graphix allows the classical preprocessing of Pauli measurements in the measurement patterns.
  arXiv  Detail & Related papers  (2022-12-22T18:58:20Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• 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)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Flow conditions for continuous variable measurement-based quantum computing [0.0]
  We introduce flow-based methods for quantum computation with continuous-variable graph states. We show that an MBQC with CV-flow approximates a unitary arbitrarily well in the infinite-squeezing limit.
  arXiv  Detail & Related papers  (2021-04-01T15:54:18Z)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)

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.