Efficient parallelization of tensor network contraction for simulating quantum computation

Area of Science:

• Quantum computing
• Computational physics
• Computer science

Background:

• Tensor networks are crucial for simulating complex quantum systems.
• Classical simulation of large quantum computations is computationally intensive.
• Existing methods face scalability challenges for larger quantum systems.

Purpose of the Study:

• To develop an efficient algorithmic framework for contracting tensor networks.
• To enable classical simulation of quantum computations at unprecedented scales.
• To accelerate the development of quantum algorithms and error correction techniques.

Main Methods:

• Developed an algorithmic framework for tensor network contraction.
• Introduced 'index slicing' for parallelizing contractions into smaller, independent subtasks.
• Benchmarked the algorithm on random quantum circuits.

Main Results:

• Achieved over 10^5 times acceleration in simulation cost compared to estimates.
• Demonstrated the framework's capability to simulate quantum computations previously out of reach.
• Validated the framework's utility in quantum algorithm and error correction development.

Conclusions:

• The developed framework significantly enhances classical simulation capabilities for quantum systems.
• Index slicing offers an efficient parallelization strategy for tensor network contractions.
• The framework has broad applicability in computational science and quantum technology development.