Simulation of many-qubit quantum computation with matrix product states

Details Simulation of many-qubit quantum computation with matrix product states Simulation of many-qubit quantum computation with matrix product states

2005-03-21

arxiv.org/abs/quant-ph/0503174v3

Phys. Rev. A 73, 022344 (2006)

Physics

Quantum Physics

5 pages, 4 figures, final version

Scientific paper

10.1103/PhysRevA.73.022344

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 a 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 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 ~ 10^30 possibilities. Accumulated statistics for up to 60 qubits point at a slow growth of the average minimum time to solve hard instances with highly-truncated simulations of adiabatic quantum evolution.

Affiliated with

Also associated with

No associations

Rating

Simulation of many-qubit quantum computation with matrix product states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulation of many-qubit quantum computation with matrix product states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulation of many-qubit quantum computation with matrix product states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160523