REVIEW 2 cited by
Constructing a virtual two-qubit gate by sampling single-qubit operations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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 $\pi/2$ 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 $\epsilon$ is roughly $O(9^k/\epsilon^2)$, where $k$ 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 large quantum computer with a small-sized quantum device, which is an idea put forward by [Peng, et al., arXiv:1904.00102]. This work can enhance the connectivity of qubits on near-term, noisy quantum computers.
Forward citations
Cited by 2 Pith papers
-
Low-Resource Quantum Energy Gap Estimation via Randomization
TE-PAI randomized time evolution can be embedded into shadow spectroscopy to estimate energy gaps, with an unbiasedness proof and demonstrations on up to 20 qubits.
-
Perspectives on Utilization of Measurements in Quantum Algorithms
A survey that categorizes quantum measurement uses into static circuits, dynamic circuits, and challenge-solving techniques, and argues measurements deserve more attention in algorithm design.
Discussion (0). Sign in to comment.