Coherence as a Resource for Shor’s Algorithm

Shor’s factoring algorithm provides a superpolynomial speedup over all known classical factoring algorithms. Here, we address the question of which quantum properties fuel this advantage. We investigate a sequential variant of Shor’s algorithm with a fixed overall structure and identify the role of...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Ahnefeld, Felix, Theurer, Thomas, Egloff, Darío, Matera, Juan Mauricio, Plenio, Martín B.
Formato: Articulo
Lenguaje:Inglés
Publicado: 2022
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/142152
Aporte de:
id I19-R120-10915-142152
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Física
Quantum Algorithms
Quantum Computation
Resource Theories
spellingShingle Física
Quantum Algorithms
Quantum Computation
Resource Theories
Ahnefeld, Felix
Theurer, Thomas
Egloff, Darío
Matera, Juan Mauricio
Plenio, Martín B.
Coherence as a Resource for Shor’s Algorithm
topic_facet Física
Quantum Algorithms
Quantum Computation
Resource Theories
description Shor’s factoring algorithm provides a superpolynomial speedup over all known classical factoring algorithms. Here, we address the question of which quantum properties fuel this advantage. We investigate a sequential variant of Shor’s algorithm with a fixed overall structure and identify the role of coherence for this algorithm quantitatively. We analyze this protocol in the framework of dynamical resource theories, which capture the resource character of operations that can create and detect coherence. This allows us to derive a lower and an upper bound on the success probability of the protocol, which depends on rigorously defined measures of coherence as a dynamical resource. We compare these bounds with the classical limit of the protocol and conclude that within the fixed structure that we consider, coherence is the quantum resource that determines its performance by bounding the success probability from below and above. Therefore, we shine new light on the fundamental role of coherence in quantum computation.
format Articulo
Articulo
author Ahnefeld, Felix
Theurer, Thomas
Egloff, Darío
Matera, Juan Mauricio
Plenio, Martín B.
author_facet Ahnefeld, Felix
Theurer, Thomas
Egloff, Darío
Matera, Juan Mauricio
Plenio, Martín B.
author_sort Ahnefeld, Felix
title Coherence as a Resource for Shor’s Algorithm
title_short Coherence as a Resource for Shor’s Algorithm
title_full Coherence as a Resource for Shor’s Algorithm
title_fullStr Coherence as a Resource for Shor’s Algorithm
title_full_unstemmed Coherence as a Resource for Shor’s Algorithm
title_sort coherence as a resource for shor’s algorithm
publishDate 2022
url http://sedici.unlp.edu.ar/handle/10915/142152
work_keys_str_mv AT ahnefeldfelix coherenceasaresourceforshorsalgorithm
AT theurerthomas coherenceasaresourceforshorsalgorithm
AT egloffdario coherenceasaresourceforshorsalgorithm
AT materajuanmauricio coherenceasaresourceforshorsalgorithm
AT pleniomartinb coherenceasaresourceforshorsalgorithm
bdutipo_str Repositorios
_version_ 1764820458976313344