Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms

Abstract

The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two non-equivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the inital preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.

10 pages, 9 figures, RevTeX4

References in corpus (27)

• Separability Criterion for Density Matrices
• Quantum Mechanics helps in searching for a needle in a haystack
• Separability of Mixed States: Necessary and Sufficient Conditions
• Efficient classical simulation of slightly entangled quantum computations
• Persistent entanglement in arrays of interacting particles
• Reliable Quantum Computers
• On the Power of One Bit of Quantum Information
• On the role of entanglement in quantum computational speed-up
• Experimental realization of a quantum algorithm
• Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
• Optimal local implementation of non-local quantum gates
• Optical Simulation of Quantum Logic
• Sophisticated quantum search without entanglement
• Partial Teleportation of Entanglement in the Noisy Environment
• Implementation of quantum search algorithm using classical Fourier optics
• Grover's search algorithm: An optical approach
• The non-local content of quantum operations
• Quantum search without entanglement
• Efficient factorization with a single pure qubit and $logN$ mixed qubits
• Efficient Quantum Computing of Complex Dynamics
• Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
• Dynamics of entanglement in quantum computers with imperfections
• Dynamical localization simulated on a few qubits quantum computer
• Quantum information processing with noisy cluster states
• Quantum Computing and Error Correction
• Algebraic analysis of quantum search with pure and mixed states
• Phase diagram for the Grover algorithm with static imperfections

Cited by in corpus (4)

• Perfect state transfer on a spin-chain without state initialization
• Nested entangled states for distributed quantum channels
• Control-limited perfect state transfer, quantum stochastic resonance and many-body entangling gate in imperfect qubit registers
• Quantum state transfer via temporal kicking of information