NAGIOS: RODERIC FUNCIONANDO

Simulation of many-qubit quantum computation with matrix product states

Repositori DSpace/Manakin

Valencià Castellano

Inici
Investigació
e-prints
22 - Física
Visualitza element

IMPORTANT: Aquest repositori està en una versió antiga des del 3/12/2023. La nova instal.lació está en https://roderic.uv.es/

Simulation of many-qubit quantum computation with matrix product states

Mostra el registre parcial de l'element

dc.contributor.author	Bañuls Polo, María Carmen
dc.contributor.author	Orus, R.
dc.contributor.author	Latorre, J. I.
dc.contributor.author	Pérez Cañellas, Armando
dc.contributor.author	Ruiz Femenía, Pedro David
dc.date.accessioned	2014-02-10T12:02:58Z
dc.date.available	2014-02-10T12:02:58Z
dc.date.issued	2006
dc.identifier.citation	Bañuls Polo, María Carmen Orus, R. Latorre, J.I. Pérez CañellaS, Armando Ruiz-Femenia, P 2006 Simulation of many-qubit quantum computation with matrix product states Physical Review A 73 2 022344 022344-5
dc.identifier.uri	http://hdl.handle.net/10550/32840
dc.description.abstract	Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of an NP-complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy (cost function) are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of similar to 10(30) possibilities. Accumulated statistics for up to 60 qubits seem to point at a subexponential growth of the average minimum time to solve hard instances with highly truncated simulations of adiabatic quantum evolution.
dc.relation.ispartof	Physical Review A, 2006, vol. 73, num. 2, p. 022344-022344-5
dc.subject	Camps, Teoria quàntica de
dc.subject	Partícules (Física nuclear)
dc.title	Simulation of many-qubit quantum computation with matrix product states
dc.type	journal article	es_ES
dc.date.updated	2014-02-10T12:02:58Z
dc.identifier.doi	10.1103/PhysRevA.73.022344
dc.identifier.idgrec	041264
dc.rights.accessRights	open access	es_ES
dc.identifier.url	10.1103/PhysRevA.73.022344