Dynamical weight reduction of Pauli measurements

• URL: http://arxiv.org/abs/2410.12527v1
• Date: Wed, 16 Oct 2024 13:03:33 GMT
• Title: Dynamical weight reduction of Pauli measurements
• Authors: Julio C. Magdalena de la Fuente,
• Abstract summary: 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.
• Score: 0.0
• License:
• Abstract: Many routines that one might want to run on a quantum computer can benefit from adaptive circuits, relying on mid-circuit measurements and feed-forward operations. Any such measurement has to be compiled into a sequence of elementary gates involving only a small number of qubits. In this work, we formalize dynamical weight reduction (DWR) schemes in which a high-weight Pauli measurement is decomposed into a sequence of measurements of smaller weight at the cost of adding additional auxiliary qubits. We first present our main method, deforming a ZX diagram that represents the measurement we want to compile. We then construct a general recipe that constructs a DWR on a given connectivity whenever the underlying connectivity graph fulfills certain necessary conditions. Further, we construct a family of DWR schemes using a given number of auxiliary qubits with indications that the schemes we present are optimal in terms of spacetime resource overheads needed for a DWR. We highlight three examples that achieve a constant time or a constant space overhead, respectively. Finally, we discuss different trade-offs of space and time overhead and how they might be chosen differently on different levels of abstraction within a (fault-tolerant) quantum computation. This work showcases the flexibility in compiling a measurement circuit in terms of lower-weight measurements using deformations of ZX diagrams and can find applications in quantum error correction, quantum simulation as well as near-term quantum computing tasks where the quality of a computation highly depends on the physical implementation of a given logical operation.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Reducing Mid-Circuit Measurements via Probabilistic Circuits [0.13108652488669736]
  Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms. This work presents a static circuit optimization that can substitute some of these measurements with an equivalent circuit with randomized gate applications.
  arXiv  Detail & Related papers  (2024-05-22T15:33:19Z)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Adaptive Quantum State Tomography with Active Learning [0.0]
  We propose and implement an efficient scheme for quantum state tomography using active learning. We apply the scheme to reconstruct different multi-qubit states with varying degree of entanglement as well as to ground states of the XXZ model in 1D and a kinetically constrained spin chain. Our scheme is highly relevant to gain physical insights in quantum many-body systems as well as for benchmarking and characterizing quantum devices.
  arXiv  Detail & Related papers  (2022-03-29T16:23:10Z)
• Hardware-efficient entangled measurements for variational quantum algorithms [0.0]
  Variational algorithms can be used to solve practical problems using noisy intermediate-scale quantum (NISQ) devices. We propose hardware-efficient entangled measurements (HEEM), that is, measurements that permit only between physically connected qubits. We show that this strategy enhances the evaluation of molecular Hamiltonians in NISQ devices by reducing the number of circuits required.
  arXiv  Detail & Related papers  (2022-02-14T19:00:16Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)

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.