Ordering Nodes for Tensor Network Contraction Based Quantum Computing Simulation

Technology

The field of quantum computing promises unparalleled computational power and transformative capabilities. One primary challenge lies in efficiently simulating and optimizing quantum circuits, particularly with the increasing interest in variational quantum-classical frameworks. Quantum simulators, especially those based on tensor network construction, offer promise in expediting this process, but their performance depends on efficiently solving computationally difficult problems like the tree width problem. Researchers at UD have developed a deterministic algorithm that constructs optimal contraction trees, significantly reducing computational complexity and outperforming existing methods. By minimizing intermediary tensor size and operation count, this algorithm enhances the overall performance of quantum circuit simulation. Additionally, the introduction of a rapid and high-quality linear ordering solver further enhances the algorithm’s efficacy by providing optimal orderings for contraction trees. Comparative analysis against competing methods highlights the superior performance of the developed solver. This breakthrough addresses a critical bottleneck in quantum computing simulation and holds implications for advancing quantum information science research and industry applications.

Benefits

  • Faster simulation of quantum computing processes
  • Improved accuracy and efficiency
  • Superior performance and improved scalability
  • Minimized computational costs and energy consumption
  • Allows for development and optimization of new quantum circuits and computing hardware

Applications

  • Quantum computing and hybrid quantum-classical computing companies
  • Cybersecurity and technology companies
  • Telecommunications and Networking companies
  • Government agencies
  • Pharmaceutical companies
  • Specialty chemicals manufacturers
  • Financial institutions