Simulating Quantum Computation by Contracting Tensor Networks
Citations
4,873 citations
842 citations
Cites background from "Simulating Quantum Computation by C..."
...Moreover, as quantum circuits can be viewed as tensor networks [51], it is quite natural to combine the existing tensor network techniques with a quantum ansatz [52– 54]....
[...]
730 citations
717 citations
706 citations
Cites methods from "Simulating Quantum Computation by C..."
...Recently, several techniques have been developed to tackle classical simulatability of MQC (refs&nbs...
[...]
References
25,929 citations
14,825 citations
"Simulating Quantum Computation by C..." refers methods in this paper
...ange the treewidth. Quantum circuits. We review some basic concepts of quantum mechanics and quantum computation. For a more detailed treatment, we refer the readers to the book by Nielsen and Chuang [24]. The state space of one qubit is denoted by Hdef= C2. We fix an orthonormal basis for Hand label the basis vectors with |0i and |1i. The space of operators on a vector space V is denoted by L(V). The ...
[...]
3,260 citations
2,019 citations
"Simulating Quantum Computation by C..." refers background in this paper
..., [26, 27, 24, 30, 24, 25, 16], have been developed to simulate quantum evoluti on by contracting variances of tensor networks under the names of Matrix Product States (MPS) , Projected Entangled Pairs States (PEPS) , etc....
[...]
...Jozsa and Linden [13], as well as Vidal [26] demonstrate efficient classical simulation of such circuits and conclude that achieving quant m speed-ups requires more than a bounded amount of entanglement....
[...]
...Jozsa and Linden [13], as we ll as Vidal [26] demonstrate efficient classical simulation of such circuits and conclude that achieving qua nt m speed-ups requires more than a bounded amount of entanglement....
[...]
...We are grateful to Guifré Vidal and Frank Verstraetefor pointing out relevant previous works....
[...]
1,726 citations