Parallelizing quantum circuits
From MaRDI portal
Abstract: We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade off in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only polynomial many auxiliary qubits. In particular, we provide for the first time a full characterization of patterns with flow of arbitrary depth, based on the notion of influencing paths and a simple rewriting system on the angles of the measurement. Our method leads to insightful knowledge for constructing parallel circuits and as applications, we demonstrate several constant and logarithmic depth circuits. Furthermore, we prove a logarithmic separation in terms of quantum depth between the quantum circuit model and the measurement-based model.
Recommendations
- scientific article; zbMATH DE number 1583875
- Parallel quantum computation and quantum codes
- Parallel computational structure of noisy quantum circuits simulation
- Computational Depth Complexity of Measurement-Based Quantum Computation
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
Cites work
- Cluster-state quantum computation
- Computational model underlying the one-way quantum computer
- Counting, fanout and the complexity of quantum ACC
- Efficient linear optics quantum computation
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Multiparty entanglement in graph states
- Parallel quantum computation and quantum codes
- Parity, circuits, and the polynomial-time hierarchy
- Quadratic Form Expansions for Unitaries
- Quantum computational networks
- Quantum theory, the Church–Turing principle and the universal quantum computer
- The measurement calculus
- Transformation rules for CNOT-based quantum circuits and their applications
Cited in
(37)- Parallel computational structure of noisy quantum circuits simulation
- Towards implementation of a generalized architecture for high-level quantum programming language
- Optimization of one-way quantum computation measurement patterns
- Quantum speed-up for unsupervised learning
- Optimized quantum circuit partitioning
- The cost reduction of distributed quantum factorization circuits
- A matrix representation of quantum circuits over non-adjacent qudits
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Scanning qubit probe of edge states in a topological insulator
- scientific article; zbMATH DE number 1583875 (Why is no real title available?)
- Parallel quantum computation and quantum codes
- Reversibility in extended measurement-based quantum computation
- Programmable Hamiltonian for one-way patterns
- Circuit design for a measurement-based quantum carry-lookahead adder
- An approximately universal set consisting of two observables
- Measurement-Based and Universal Blind Quantum Computation
- Ancilla-driven quantum computation with twisted graph states
- scientific article; zbMATH DE number 2013812 (Why is no real title available?)
- scientific article; zbMATH DE number 1462669 (Why is no real title available?)
- scientific article; zbMATH DE number 6866338 (Why is no real title available?)
- Quantum computation: from a programmer's perspective
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Entanglement spectroscopy with a depth-two quantum circuit
- Parallel Processing and Applied Mathematics
- Parsing a Sequence of Qubits
- Entanglement, flow and classical simulatability in measurement based quantum computation
- Quadratic Form Expansions for Unitaries
- Outcome determinism in measurement-based quantum computation with qudits
- QCMPI: A parallel environment for quantum computing
- Implementing evolutionary optimization on actual quantum processors
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Emerging applications of measurement-based quantum computing
- Scalable modular architecture for universal quantum computation
- An algebraic formulation of Pauli flow, leading to faster flow-finding algorithms
- Quantum algorithms for longest common and palindromic substrings in the circuit model
- Ancilla-free quantum adder with sublinear depth
- Complete flow-preserving rewrite rules for MBQC patterns with Pauli measurements
This page was built for publication: Parallelizing quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029356)
