Zobrazeno 1 - 10
of 546
pro vyhledávání: '"Portugal R"'
Publikováno v:
Phys. Rev. A 103, 062202 (2021)
The quantum walk is a powerful tool to develop quantum algorithms, which usually are based on searching for a vertex in a graph with multiple marked vertices, Ambainis's quantum algorithm for solving the element distinctness problem being the most sh
Externí odkaz:
http://arxiv.org/abs/2103.12878
Autor:
Abreu, A., Cunha, L., Fernandes, T., de Figueiredo, C., Kowada, L., Marquezino, F., Posner, D., Portugal, R.
Publikováno v:
Theoretical Computer Science 801, 175-191, 2020
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a tessellati
Externí odkaz:
http://arxiv.org/abs/1712.07476
Autor:
Almazán, F, Benito, AI, Buedo, MI, Calvo, C, Cañete, A, Cruz, O, Esquembre, C, Fernández, M, Fernández-Teijeiro Álvarez, A, Fuster, JL, García, M, Gil López, C, Gómez, J, Gondra, A, González, M, González, H, Herrero, B, Lassaletta, A, López, R, López-Ibor Aliño, B, Madero, L, Maldonado, S, Mares, FJ, Márquez, C, Mateos, ME, Melwani, K, Mendoza, MC, Moreno, L, Moreno, ML, Muñoz, GM, Ortega, MJ, Panizo, E, Pisa Gatell, S, Portugal, R, Sagaseta, M, Salinas, JA, Sastre, A, Tallón, M, Torrent, M, Uriz, JJ, Varo, A, Vázquez, MA, Vílchez, JS, Villegas, JA, Vivanco, JL, Zamora, M, Alamo, R, Alemán, A, Chico, M, Chirlaque, MD, Galceran, J, Marcos, R, Mateos, A, Quirós, JR, Sanchez-Contador, C, Sabater, C, Cañete, Adela, Peris-Bonet, Rafael, Capocaccia, Riccardo, Pardo-Romaguera, Elena, Segura, Vanessa, Muñoz-López, Ana, Fernández-Teijeiro, Ana, Galceran-Padros, Jaume, Gatta, Gemma
Publikováno v:
In Cancer Epidemiology June 2022 78
Publikováno v:
Quantum Information Processing, Vol 15, Issue 1, pp 85-101, 2016
There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as Szegedy's and staggered QWs. We give a formal definition of the stagg
Externí odkaz:
http://arxiv.org/abs/1505.04761
Publikováno v:
Physical Review A 90, 032324 (2014)
We show how to extract the scaling behavior of quantum walks using the renormalization group (RG). We introduce the method by efficiently reproducing well-known results on the one-dimensional lattice. As a nontrivial model, we apply this method to th
Externí odkaz:
http://arxiv.org/abs/1311.3369
The "abstract search algorithm" is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which t
Externí odkaz:
http://arxiv.org/abs/1205.0529
Autor:
Goncalves, D. N., Portugal, R.
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new polynomial-t
Externí odkaz:
http://arxiv.org/abs/1104.1361
Publikováno v:
Mathematical Structures in Computer Science, 22, pp 521-531 (2012)
The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. We propose a quantum algorithm for the
Externí odkaz:
http://arxiv.org/abs/1009.1422
Publikováno v:
Physical Review A, v. 82, p. 042341, 2010
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact express
Externí odkaz:
http://arxiv.org/abs/1006.4625
Publikováno v:
Journal of Computational and Applied Mathematics, v. 235, p. 74-81, 2010
We present the detailed process of converting the classical Fourier Transform algorithm into the quantum one by using QR decomposition. This provides an example of a technique for building quantum algorithms using classical ones. The Quantum Fourier
Externí odkaz:
http://arxiv.org/abs/1005.3730