Pith. sign in

REVIEW 1 cited by

Overhead for simulating a non-local channel with local channels by quasiprobability sampling

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

arxiv 2006.11174 v2 pith:OBLCWP64 submitted 2020-06-19 quant-ph

classification quant-ph
keywords channelnon-localdecompositionlocalquantumtwo-qubitworkapplications
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As the hardware technology for quantum computing advances, its possible applications are actively searched and developed. However, such applications still suffer from the noise on quantum devices, in particular when using two-qubit gates whose fidelity is relatively low. One way to overcome this difficulty is to substitute such non-local operations by local ones. Such substitution can be performed by decomposing a non-local channel into a linear combination of local channels and simulating the original channel with a quasiprobability-based method. In this work, we first define a quantity that we call channel robustness of non-locality, which quantifies the cost for the decomposition. While this quantity is challenging to calculate for a general non-local channel, we give an upper bound for a general two-qubit unitary channel by providing an explicit decomposition. The decomposition is obtained by generalizing our previous work whose application has been restricted to a certain form of two-qubit unitary. This work develops a framework for a resource reduction suitable for first-generation quantum devices.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Perspectives on Utilization of Measurements in Quantum Algorithms

    quant-ph 2025-07 conditional novelty 3.0 of 10

    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.

Pith tools