| | |
| | |
Stat |
Members: 3658 Articles: 2'599'751 Articles rated: 2609
03 November 2024 |
|
| | | |
|
Article overview
| |
|
Simulating quantum circuits using tree tensor networks | Philipp Seitz
; Ismael Medina
; Esther Cruz
; Qunsheng Huang
; Christian B. Mendl
; | Date: |
2 Jun 2022 | Abstract: | We develop and analyze a method for simulating quantum circuits on classical
computers by representing quantum states as rooted tree tensor networks. Our
algorithm first determines a suitable, fixed tree structure adapted to the
expected entanglement generated by the quantum circuit. The gates are
sequentially applied to the tree by absorbing single-qubit gates into leaf
nodes, and splitting two-qubit gates via singular value decomposition and
threading the resulting virtual bond through the tree. We theoretically analyze
the applicability of the method as well as its computational cost and memory
requirements, and identify advantageous scenarios in terms of required bond
dimensions as compared to a matrix product state representation. The study is
complemented by numerical experiments for different quantum circuit layouts up
to 37 qubits. | Source: | arXiv, 2206.01000 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|