Graphix: optimizing and simulating measurement-based quantum computation
on local-Clifford decorated graph
- URL: http://arxiv.org/abs/2212.11975v1
- Date: Thu, 22 Dec 2022 18:58:20 GMT
- Title: Graphix: optimizing and simulating measurement-based quantum computation
on local-Clifford decorated graph
- Authors: Shinichi Sunami, Masato Fukushima
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce an open-source software library Graphix, which optimizes 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,
significantly reducing the number of operations required to perform the quantum
computation while maintaining determinism. For a measurement pattern translated
from a quantum circuit, this corresponds to the preprocessing of all Clifford
gates, and this improvement in the one-way model is important for efficient
operations in quantum hardware with limited qubit numbers. In addition to the
direct translation from gate networks, we provide a pattern generation method
based on flow-finding algorithms, which automatically generates byproduct
correction sequences to ensure determinism. We further implement optimization
strategies for measurement patterns beyond the standardization procedure and
provide tensor-network backend for classically simulating the MBQC.
Related papers
- Measurement-Based Quantum Approximate Optimization [0.24861619769660645]
We focus on measurement-based quantum computing protocols for approximate optimization.
We derive measurement patterns for applying QAOA to the broad and important class of QUBO problems.
We discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.
arXiv Detail & Related papers (2024-03-18T06:59:23Z) - 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) - On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices.
For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator.
For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
arXiv Detail & Related papers (2023-09-05T04:39:34Z) - Robust and efficient verification of graph states in blind
measurement-based quantum computation [52.70359447203418]
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients.
It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario.
Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
arXiv Detail & Related papers (2023-05-18T06:24:45Z) - Optimization at the Interface of Unitary and Non-unitary Quantum
Operations in PCOAST [0.3496513815948205]
Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits.
In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations.
We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-05-16T22:58:14Z) - 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) - Gradient-descent quantum process tomography by learning Kraus operators [63.69764116066747]
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems.
We use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators.
The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes.
arXiv Detail & Related papers (2022-08-01T12:48:48Z) - 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) - Efficient calculation of gradients in classical simulations of
variational quantum algorithms [0.0]
We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time.
Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives.
It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
arXiv Detail & Related papers (2020-09-06T21:39: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.