Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.10340 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918242711240704 |
|---|---|
| author | Huang, Mingyu Guan, Ji Fang, Wang Ying, Mingsheng |
| author_facet | Huang, Mingyu Guan, Ji Fang, Wang Ying, Mingsheng |
| contents | In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation and equivalence checking to circuits with a limited number of qubits. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits, specifically designed to improve scalability under low-noise conditions. The approach utilizes a novel tensor network diagram combined with singular value decomposition to approximate the tensors of quantum noises. The implementation is based on Google's TensorNetwork Python package for contraction. Experimental results on realistic quantum circuits with realistic hardware noise models indicate that our algorithm can simulate and check the equivalence of QAOA (Quantum Approximate Optimization Algorithm) circuits with around 200 qubits and 20 noise operators, outperforming state-of-the-art approaches in scalability and speed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10340 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits Huang, Mingyu Guan, Ji Fang, Wang Ying, Mingsheng Quantum Physics In the current NISQ (Noisy Intermediate-Scale Quantum) era, simulating and verifying noisy quantum circuits is crucial but faces challenges such as quantum state explosion and complex noise representations, constraining simulation and equivalence checking to circuits with a limited number of qubits. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits, specifically designed to improve scalability under low-noise conditions. The approach utilizes a novel tensor network diagram combined with singular value decomposition to approximate the tensors of quantum noises. The implementation is based on Google's TensorNetwork Python package for contraction. Experimental results on realistic quantum circuits with realistic hardware noise models indicate that our algorithm can simulate and check the equivalence of QAOA (Quantum Approximate Optimization Algorithm) circuits with around 200 qubits and 20 noise operators, outperforming state-of-the-art approaches in scalability and speed. |
| title | Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2503.10340 |