default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenato Portugal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Pedro H. G. Lugão
, Renato Portugal:
Quantum search by continuous-time quantum walk on t-designs. Quantum Inf. Process. 23(4): 140 (2024)- [i25]Paulo Motta, Gustavo A. Bezerra, Anderson Fernandes P. Santos, Renato Portugal:
Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing. CoRR abs/2406.08186 (2024) - 2023
- [j32]Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal:
Walking on vertices and edges by continuous-time quantum walk. Quantum Inf. Process. 22(2): 93 (2023) - [j31]Anderson de Souza Barbosa, Franklin de Lima Marquezino, Renato Portugal:
Steane code analysis by randomized benchmarking. RAIRO Oper. Res. 57(2): 905-912 (2023) - [c6]Paulo Motta, Gustavo A. Bezerra, Anderson Fernandes P. Santos, Renato Portugal:
Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing. QCE 2023: 424-433 - [i24]Pedro H. G. Lugão, Renato Portugal:
Quantum search by continuous-time quantum walk on t-designs. CoRR abs/2310.14141 (2023) - [i23]Gustavo A. Bezerra, Raqueline A. M. Santos, Renato Portugal:
Quantum Counting by Quantum Walks. CoRR abs/2311.10407 (2023) - 2022
- [j30]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
Total tessellation cover: Bounds, hardness, and applications. Discret. Appl. Math. 323: 149-161 (2022) - [j29]Hajime Tanaka, Mohamed Sabri, Renato Portugal:
Spatial search on Johnson graphs by continuous-time quantum walk. Quantum Inf. Process. 21(2): 74 (2022) - [j28]Carlile Lavor, Franklin L. Marquezino, Andrês Oliveira, Renato Portugal:
A quantum approach to the discretizable molecular distance geometry problem. Quantum Inf. Process. 21(7): 239 (2022) - [i22]Renato Portugal:
Basic Quantum Algorithms. CoRR abs/2201.10574 (2022) - [i21]Pedro H. G. Lugão, Renato Portugal, Mohamed Sabri, Hajime Tanaka:
Multimarked Spatial Search by Continuous-Time Quantum Walk. CoRR abs/2203.14384 (2022) - [i20]Cauê F. Teixeira da Silva, Daniel Posner, Renato Portugal:
Walking on Vertices and Edges by Continuous-Time Quantum Walk. CoRR abs/2206.03375 (2022) - 2021
- [j27]Rafael Cação, Lucas R. C. T. Cortez, Ismael R. de Farias Jr., Ernee Kozyreff, Jalil Khatibi Moqadam, Renato Portugal:
Quantum Walk on the Generalized Birkhoff Polytope Graph. Entropy 23(10): 1239 (2021) - [j26]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner:
A computational complexity comparative study of graph tessellation problems. Theor. Comput. Sci. 858: 81-89 (2021) - [i19]Gustavo A. Bezerra, Pedro H. G. Lugão, Renato Portugal:
Quantum walk-based search algorithms with multiple marked vertices. CoRR abs/2103.12878 (2021) - [i18]Hajime Tanaka, Mohamed Sabri, Renato Portugal:
Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk. CoRR abs/2108.01992 (2021) - [i17]Hajime Tanaka, Mohamed Sabri, Renato Portugal:
Spatial Search on Johnson Graphs by Discrete-Time Quantum Walk. CoRR abs/2112.03744 (2021) - 2020
- [j25]Frank Acasiete, Flavia P. Agostini, Jalil Khatibi Moqadam, Renato Portugal:
Implementation of quantum walks on IBM quantum computers. Quantum Inf. Process. 19(12): 426 (2020) - [j24]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness. Theor. Comput. Sci. 801: 175-191 (2020) - [c5]Bruno Chagas, Renato Portugal:
Discrete-Time Quantum Walks on Oriented Graphs. QSQW 2020: 26-37 - [i16]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
Total tessellation cover and quantum walk. CoRR abs/2002.08992 (2020)
2010 – 2019
- 2019
- [b1]Franklin de Lima Marquezino, Renato Portugal, Carlile Lavor:
A Primer on Quantum Computing. Springer Briefs in Computer Science, Springer 2019, ISBN 978-3-030-19065-1, pp. 1-105 - [j23]Gabriel Coutinho, Renato Portugal:
Discretization of continuous-time quantum walks via the staggered model with Hamiltonians. Nat. Comput. 18(2): 403-409 (2019) - [i15]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Renato Portugal, Daniel Posner:
The Tessellation Cover Number of Good Tessellable Graphs. CoRR abs/1908.10844 (2019) - 2018
- [j22]Norio Konno, Renato Portugal, Iwao Sato, Etsuo Segawa:
Partition-based discrete-time quantum walks. Quantum Inf. Process. 17(4): 100 (2018) - [j21]Renato Portugal:
Element distinctness revisited. Quantum Inf. Process. 17(7): 163 (2018) - [j20]Pedro C. S. Costa, Renato Portugal, Fernando de Melo:
Quantum walks via quantum cellular automata. Quantum Inf. Process. 17(9): 226 (2018) - [c4]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness. LATIN 2018: 1-13 - 2017
- [j19]Fábio Borges, Pedro C. S. Lara, Renato Portugal:
Parallel algorithms for modular multi-exponentiation. Appl. Math. Comput. 292: 406-416 (2017) - [j18]Pascal Philipp, Renato Portugal:
Exact simulation of coined quantum walks with the continuous-time model. Quantum Inf. Process. 16(1): 14 (2017) - [i14]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The tessellation problem of quantum walks. CoRR abs/1705.09014 (2017) - [i13]Stefan Boettcher, Shanshan Li, Tharso D. Fernandes, Renato Portugal:
Determining the Efficiency of Quantum Search Algorithms with the Renormalization Group. CoRR abs/1708.05339 (2017) - [i12]Renato Portugal:
Element Distinctness Revisited. CoRR abs/1711.11336 (2017) - [i11]Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Tharso D. Fernandes, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Franklin L. Marquezino, Daniel Posner, Renato Portugal:
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness. CoRR abs/1712.07476 (2017) - 2016
- [j17]Renato Portugal, Raqueline A. M. Santos, Tharso D. Fernandes, Demerson N. Gonçalves:
The staggered quantum walk model. Quantum Inf. Process. 15(1): 85-101 (2016) - [j16]Renato Portugal:
Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model. Quantum Inf. Process. 15(4): 1387-1409 (2016) - 2015
- [j15]Andris Ambainis, Renato Portugal, Nikolay Nahimov:
Spatial search on grids with minimum memory. Quantum Inf. Comput. 15(13&14): 1233-1247 (2015) - [j14]Raqueline Azevedo Medeiros Santos, Renato Portugal, Stefan Boettcher:
Moments of coinless quantum walks on lattices. Quantum Inf. Process. 14(9): 3179-3191 (2015) - [j13]Jalil Khatibi Moqadam, Renato Portugal, Marcos César de Oliveira:
Quantum walks on a circle with optomechanical systems. Quantum Inf. Process. 14(10): 3595-3611 (2015) - [c3]Juan del Carmen Grados Vasquez, Fábio Borges, Renato Portugal, Pedro C. S. Lara:
An Efficient One-Bit Model for Differential Fault Analysis on Simon Family. FDTC 2015: 61-70 - 2014
- [j12]Pedro C. S. Lara, Renato Portugal, Carlile Lavor:
A new hybrid classical-quantum algorithm for continuous global optimization problems. J. Glob. Optim. 60(2): 317-331 (2014) - [j11]Raqueline Azevedo Medeiros Santos, Renato Portugal, Marcelo Dutra Fragoso:
Decoherence in quantum Markov chains. Quantum Inf. Process. 13(2): 559-572 (2014) - 2013
- [j10]Douglas F. G. Santiago, Renato Portugal, Nolmar Melo:
Non-Pauli observables for CWS codes. Quantum Inf. Process. 12(5): 1871-1884 (2013) - 2012
- [j9]Pedro C. S. Lara, Fábio Borges, Renato Portugal, Nadia Nedjah:
Parallel modular exponentiation using load balancing without precomputation. J. Comput. Syst. Sci. 78(2): 575-582 (2012) - [j8]Gonzalo Abal, Raul Donangelo, M. Forets, Renato Portugal:
Spatial quantum search in a triangular network. Math. Struct. Comput. Sci. 22(3): 521-531 (2012) - [i10]Nolmar Melo, Douglas F. G. Santiago, Renato Portugal:
Decoder for Nonbinary CWS Quantum Codes. CoRR abs/1204.2218 (2012) - [i9]Douglas F. G. Santiago, Renato Portugal, Nolmar Melo:
Non-Pauli Observables for CWS Codes. CoRR abs/1206.1566 (2012) - 2011
- [c2]Franklin de Lima Marquezino, Renato Portugal, Stefan Boettcher:
Quantum search algorithms on hierarchical networks. ITW 2011: 247-251 - 2010
- [j7]Franklin L. Marquezino, Renato Portugal, F. D. Sasse:
Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition. J. Comput. Appl. Math. 235(1): 74-81 (2010) - [j6]Gonzalo Abal, Raul Donangelo, Franklin L. Marquezino, Renato Portugal:
Spatial search on a honeycomb network. Math. Struct. Comput. Sci. 20(6): 999-1009 (2010) - [i8]Gonzalo Abal, Raul Donangelo, Franklin L. Marquezino, Renato Portugal:
Spatial search in a honeycomb network. CoRR abs/1001.1139 (2010) - [i7]Franklin L. Marquezino, Renato Portugal, F. D. Sasse:
Obtaining the Quantum Fourier Transform from the Classical FFT with QR Decomposition. CoRR abs/1005.3730 (2010) - [i6]Franklin L. Marquezino, Renato Portugal, Gonzalo Abal:
Mixing Times in Quantum Walks on Two-Dimensional Grids. CoRR abs/1006.4625 (2010)
2000 – 2009
- 2009
- [c1]Demerson N. Gonçalves, Renato Portugal, Carlos Magno Martins Cosme:
Solutions to the Hidden Subgroup Problem on Some Metacyclic Groups. TCQ 2009: 1-9 - [i5]Gonzalo Abal, Raul Donangelo, Franklin L. Marquezino, Amanda C. Oliveira, Renato Portugal:
Decoherence in Search Algorithms. CoRR abs/0912.1523 (2009) - 2008
- [j5]Franklin L. Marquezino, Renato Portugal:
The QWalk simulator of quantum walks. Comput. Phys. Commun. 179(5): 359-369 (2008) - [j4]José M. Martín-García, David Yllanes, Renato Portugal:
The Invar tensor package: Differential invariants of Riemann. Comput. Phys. Commun. 179(8): 586-590 (2008) - [i4]José M. Martín-García, David Yllanes, Renato Portugal:
The Invar tensor package: Differential invariants of Riemann. CoRR abs/0802.1274 (2008) - [i3]Franklin L. Marquezino, Renato Portugal:
The QWalk Simulator of Quantum Walks. CoRR abs/0803.3459 (2008) - 2007
- [j3]José M. Martín-García, Renato Portugal, Leon R. U. Manssur:
The Invar tensor package. Comput. Phys. Commun. 177(8): 640-648 (2007) - [i2]José M. Martín-García, Renato Portugal, Leon R. U. Manssur:
The Invar Tensor Package. CoRR abs/0704.1756 (2007) - 2006
- [j2]Luis Antonio Brasil Kowada, Renato Portugal, Celina M. H. de Figueiredo:
Reversible Karatsuba's Algorithm. J. Univers. Comput. Sci. 12(5): 499-511 (2006) - 2004
- [i1]Gilson A. Giraldi, Renato Portugal, Ricardo N. Thess:
Genetic Algorithms and Quantum Computation. CoRR cs.NE/0403003 (2004)
1990 – 1999
- 1999
- [j1]Daniel Frenkel, Laura Golebiowski, Renato Portugal:
Computer algebra takes on the vibrating-membrane problem. Comput. Sci. Eng. 1(2): 88-93 (1999)
Coauthor Index
aka: Franklin de Lima Marquezino
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
