Constructing a virtual two-qubit gate by sampling single-qubit operations
Kosuke Mitarai, Keisuke Fujii

TL;DR
This paper introduces a method to simulate non-local two-qubit gates using local operations and sampling, enabling virtual gates and improved connectivity in near-term quantum computers.
Contribution
The authors propose a sampling-based decomposition of two-qubit gates into single-qubit operations, facilitating virtual interactions without direct coupling.
Findings
Sampling complexity is roughly O(9^k/ε^2) for expectation value accuracy.
Enables virtual two-qubit gates between distant qubits without direct interaction.
Improves qubit connectivity and simulation capabilities on noisy, small-scale quantum devices.
Abstract
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and rotation around x, y, and z axes. The required number of sampling to get an expectation value of a target observable within an error of is roughly , where is the number of "cuts" performed. The proposed technique enables to perform "virtual" gates between a distant pair of qubits, where there is no direct interaction and thus a number of swap gates are inevitable otherwise. It can also be utilized to improve the simulation of a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
