Equivalence checking of quantum circuits by nonlocality
- URL: http://arxiv.org/abs/2105.02634v2
- Date: Wed, 10 Aug 2022 09:07:02 GMT
- Title: Equivalence checking of quantum circuits by nonlocality
- Authors: Weixiao Sun and Zhaohui Wei
- Abstract summary: We show that this realistic problem can be solved completely from the viewpoints of quantum nonlocality.
Specifically, we design an elegant protocol that examines underlying quantum nonlocality.
We show that the protocol also works approximately, where the distance between two quantum circuits can be calculated accurately.
- Score: 0.6091702876917279
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Suppose two quantum circuit chips are located at different places, for which
we do not have any prior knowledge, and cannot see the internal structures
either. If we want to find out whether they have the same functions or not with
certainty, what should we do? In this paper, we show that this realistic
problem can be solved completely from the viewpoints of quantum nonlocality.
Specifically, we design an elegant protocol that examines underlying quantum
nonlocality, where the strongest nonlocality can be observed if and only if two
quantum circuits are equivalent to each other. We show that the protocol also
works approximately, where the distance between two quantum circuits can be
calculated accurately by observed quantum nonlocality in an analytical manner.
Furthermore, it turns out that the computational cost of our protocol is
independent in the size of compared quantum circuits. Lastly, we also discuss
the possibility to generalize the protocol to multipartite cases, i.e., if we
do equivalence checking for multiple quantum circuits, we try to solve the
problem in one go.
Related papers
- Exponential separation in quantum query complexity of the quantum switch with respect to simulations with standard quantum circuits [1.151731504874944]
We prove that the action of the quantum switch on two $n$-qubit quantum channels cannot be simulated deterministically.
This demonstrates an exponential separation in quantum query complexity of indefinite causal order compared to standard quantum circuits.
arXiv Detail & Related papers (2024-09-27T03:18:28Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Partial Equivalence Checking of Quantum Circuits [23.357645240384876]
Equivalence checking of quantum circuits is an essential element in quantum program compilation.
We devise algorithms for checking quantum circuits whose partial equivalence cannot be verified.
arXiv Detail & Related papers (2022-08-16T06:56:53Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Equivalence Checking of Dynamic Quantum Circuits [7.835264621634824]
State-of-the-art quantum devices still contain only a very limited number of qubits.
One possible way to execute more realistic algorithms in near-term quantum devices is to employ dynamic quantum circuits.
This technique can help to significantly reduce the resources required to achieve a given accuracy of a quantum algorithm.
arXiv Detail & Related papers (2021-06-03T08:03:22Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z) - Quantifying the difference between many-body quantum states [0.0]
We introduce the weighted distances, a new class of information-theoretic measures.
They quantify how hard it is to discriminate between two quantum states of many particles.
They can be used to evaluate both the theoretical and the experimental performances of complex quantum devices.
arXiv Detail & Related papers (2020-12-10T12:10:09Z)
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.