A Bridge-based Compression Algorithm for Topological Quantum Circuits
Chen-Hao Hsu,Wan-Hsuan Lin,Wei-Hsiang Tseng,Yao-Wen Chang +3 more
- pp 457-462
Reads0
Chats0
TLDR
Wang et al. as mentioned in this paper presented the first work that can automatically perform bridge compression on topological quantum error correction (TQEC) circuits, which can averagely reduce space-time volumes by 83%.Abstract:
The topological quantum error correction (TQEC) scheme is promising for scalable and reliable quantum computing. A TQEC circuit can be modeled by a three-dimensional diagram, and the implementation resource of a TQEC circuit is abstracted to its space-time volume. Implementing a quantum algorithm with a reasonable physical qubit number and reasonable computation time is challenging for large-scale practical problems. Therefore, minimizing the space-time volume of a TQEC circuit becomes a crucial issue. Previous work shows that bridge compression can greatly compress TQEC circuits, but it was performed only manually. It is desirable to develop automated compression techniques for TQEC circuits to achieve low-overhead, large-scale quantum computations. In this paper, we present the first work that can automatically perform bridge compression on TQEC circuits. Compared with the state-of-the-art method, experimental results show that our proposed algorithm can averagely reduce space-time volumes by 83%.read more
Citations
More filters
Journal ArticleDOI
A Bridge-Based Compression Algorithm for Topological Quantum Circuits
TL;DR: Wang et al. as mentioned in this paper proposed a bridge compression technique to compact TQEC circuits with modularization, and they also proposed a time-ordering-aware 2.5D placement for compacting TQec circuits and satisfying time-ordered measurement constraints.
Proceedings ArticleDOI
A bridge-based algorithm for simultaneous primal and dual defects compression on topologically quantum-error-corrected circuits
Wei-Hsiang Tseng,Yao-Wen Chang +1 more
TL;DR: Wang et al. as discussed by the authors proposed an automated bridging compression algorithm for large-scale topological quantum error correction (TQEC) circuits, which performs initialization/measurement simplification and flipping to improve the compression.
References
More filters
Journal ArticleDOI
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Journal ArticleDOI
Surface codes: Towards practical large-scale quantum computation
TL;DR: The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Proceedings ArticleDOI
PathFinder: A Negotiation-Based Performance-Driven Router for FPGAs
Larry E. McMurchie,Carl Ebeling +1 more
TL;DR: PathFinder as mentioned in this paper uses an iterative algorithm that converges to a solution in which all signals are routed while achieving close to the optimal performance allowed by the placement, which is achieved by forcing signals to negotiate for a resource and thereby determine which signal needs the resource most.
Proceedings ArticleDOI
B*-Trees: a new representation for non-slicing floorplans
TL;DR: An efficient, flexible, and effective data structure, B-trees for non-slicing floorplans, based on ordered binary trees and the admissible placement presented in [1], and a B-tree based simulated annealing scheme for floorplan design.
Journal ArticleDOI
Topological fault-tolerance in cluster state quantum computation
TL;DR: In this article, a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions is described, where topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster.