741 citations · 1.9k across the 11 of their papers we have counts for
Showing 2003 · quant-phShow all
2 papers · 2 filters
quant-ph2003
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
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…