activity
20022024
most citedA Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States

2.1k citations · 8.6k across the 93 of their papers we have counts for

collaborators
Showing 2003Show all

2 papers · 1 filter

quant-ph2003★ 77 cited

Universality of Entanglement and Quantum Computation Complexity

Roman Orus, Jose I. Latorre

We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Ex…

quant-ph2003★ 57 cited

Adiabatic quantum computation and quantum phase transitions

Jose Ignacio Latorre, Roman Orus

We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey…