scholarly journals Quantum speed-up process of atom in dissipative cavity

2020 ◽  
Vol 53 (13) ◽  
pp. 135502
Author(s):  
Hong-Mei Zou ◽  
Jianhe Yang ◽  
Danping Lin ◽  
Mao-Fa Fang
Keyword(s):  
Speed Up ◽  
2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Valentin Gebhart ◽  
Luca Pezzè ◽  
Augusto Smerzi

AbstractDespite intensive research, the physical origin of the speed-up offered by quantum algorithms remains mysterious. No general physical quantity, like, for instance, entanglement, can be singled out as the essential useful resource. Here we report a close connection between the trace speed and the quantum speed-up in Grover’s search algorithm implemented with pure and pseudo-pure states. For a noiseless algorithm, we find a one-to-one correspondence between the quantum speed-up and the polarization of the pseudo-pure state, which can be connected to a wide class of quantum statistical speeds. For time-dependent partial depolarization and for interrupted Grover searches, the speed-up is specifically bounded by the maximal trace speed that occurs during the algorithm operations. Our results quantify the quantum speed-up with a physical resource that is experimentally measurable and related to multipartite entanglement and quantum coherence.


2021 ◽  
Vol 67 (1) ◽  
pp. 241-252
Author(s):  
Wenbin Yu ◽  
Hao Feng ◽  
Yinsong Xu ◽  
Na Yin ◽  
Yadang Chen ◽  
...  

2019 ◽  
Vol 9 (1) ◽  
Author(s):  
G. G. Guerreschi ◽  
A. Y. Matsuura
Keyword(s):  
Speed Up ◽  

2019 ◽  
Vol 18 (4) ◽  
Author(s):  
Sebastián Alberto Grillo ◽  
Franklin de Lima Marquezino
Keyword(s):  
Speed Up ◽  

2021 ◽  
Vol 24 (3) ◽  
pp. 207-221
Author(s):  
Kamil Khadiev ◽  
Vladislav Remidovskii

We study algorithms for solving the problem of assembling a text (long string) from a dictionary (a sequence of small strings). The problem has an application in bioinformatics and has a connection with the sequence assembly method for reconstructing a long deoxyribonucleic-acid (DNA) sequence from small fragments. The problem is assembling a string t of length n from strings s1,...,sm. Firstly, we provide a classical (randomized) algorithm with running time Õ(nL0.5 + L) where L is the sum of lengths of s1,...,sm. Secondly, we provide a quantum algorithm with running time Õ(nL0.25 + √mL). Thirdly, we show the lower bound for a classical (randomized or deterministic) algorithm that is Ω(n+L). So, we obtain the quadratic quantum speed-up with respect to the parameter L; and our quantum algorithm have smaller running time comparing to any classical (randomized or deterministic) algorithm in the case of non-constant length of strings in the dictionary.


2015 ◽  
Vol 91 (3) ◽  
Author(s):  
Ying-Jie Zhang ◽  
Wei Han ◽  
Yun-Jie Xia ◽  
Jun-Peng Cao ◽  
Heng Fan
Keyword(s):  
Speed Up ◽  

2011 ◽  
Author(s):  
Giuseppe Castagnoli ◽  
Daniel P. Sheehan
Keyword(s):  
Speed Up ◽  

Nature ◽  
2021 ◽  
Vol 591 (7849) ◽  
pp. 229-233
Author(s):  
V. Saggio ◽  
B. E. Asenbeck ◽  
A. Hamann ◽  
T. Strömberg ◽  
P. Schiansky ◽  
...  

Author(s):  
Yidong Liao ◽  
Daniel Ebler ◽  
Feiyang Liu ◽  
Oscar Dahlsten

Sign in / Sign up

Export Citation Format

Share Document