Optimization of one-way quantum computation measurement patterns
From MaRDI portal
Quantum computation (81P68) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Abstract: In one-way quantum computation (1WQC) model, an initial highly entangled state called a graph state is used to perform universal quantum computations by a sequence of adaptive single-qubit measurements and post-measurement Pauli-X and Pauli-Z corrections. The needed computations are organized as measurement patterns, or simply patterns, in the 1WQC model. The entanglement operations in a pattern can be shown by a graph which together with the set of its input and output qubits is called the geometry of the pattern. Since a one-way quantum computation pattern is based on quantum measurements, which are fundamentally nondeterministic evolutions, there must be conditions over geometries to guarantee determinism. Causal flow is a sufficient and generalized flow (gflow) is a necessary and sufficient condition over geometries to identify a dependency structure for the measurement sequences in order to achieve determinism. Previously, three optimization methods have been proposed to simplify 1WQC patterns which are called standardization, signal shifting and Pauli simplification. These optimizations can be performed using measurement calculus formalism by rewriting rules. However, maintaining and searching these rules in the library can be complicated with respect to implementation. Moreover, serial execution of these rules is time consuming due to executing many ineffective commutation rules. To overcome this problem, in this paper, a new scheme is proposed to perform optimization techniques on patterns with flow or gflow only based on their geometries instead of using rewriting rules. Furthermore, the proposed scheme obtains the maximally delayed gflow order for geometries with flow. It is shown that the time complexity of the proposed approach is improved over the previous ones.
Recommendations
Cites work
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Extended measurement calculus
- Finding Optimal Flows Efficiently
- MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
- One-way quantum computation
- Optimization of one-way quantum computation measurement patterns
- Parallelizing quantum circuits
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The measurement calculus
Cited in
(9)- An extremal result for geometries in the one-way measurement model
- Finding Optimal Flows Efficiently
- Extended phase map decompositions for unitaries
- Outcome determinism in measurement-based quantum computation with qudits
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
- Automatic translation of quantum circuits to optimized one-way quantum computation patterns
- Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures
- Relating measurement patterns to circuits via Pauli flow
- Optimization of one-way quantum computation measurement patterns
This page was built for publication: Optimization of one-way quantum computation measurement patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1740762)
