Renato Portugal

Orcid: 0000-0003-0894-4279

According to our database1, Renato Portugal authored at least 53 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantum search by continuous-time quantum walk on t-designs.
Quantum Inf. Process., April, 2024

2023
Steane code analysis by randomized benchmarking.
RAIRO Oper. Res., March, 2023

Walking on vertices and edges by continuous-time quantum walk.
Quantum Inf. Process., February, 2023

Quantum Counting by Quantum Walks.
CoRR, 2023

Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022
Spatial search on Johnson graphs by continuous-time quantum walk.
Quantum Inf. Process., 2022

A quantum approach to the discretizable molecular distance geometry problem.
Quantum Inf. Process., 2022

Total tessellation cover: Bounds, hardness, and applications.
Discret. Appl. Math., 2022

Multimarked Spatial Search by Continuous-Time Quantum Walk.
CoRR, 2022

Basic Quantum Algorithms.
CoRR, 2022

2021
A computational complexity comparative study of graph tessellation problems.
Theor. Comput. Sci., 2021

Quantum Walk on the Generalized Birkhoff Polytope Graph.
Entropy, 2021

Spatial Search on Johnson Graphs by Discrete-Time Quantum Walk.
CoRR, 2021

Quantum walk-based search algorithms with multiple marked vertices.
CoRR, 2021

2020
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.
Theor. Comput. Sci., 2020

Implementation of quantum walks on IBM quantum computers.
Quantum Inf. Process., 2020

Total tessellation cover and quantum walk.
CoRR, 2020

Discrete-Time Quantum Walks on Oriented Graphs.
Proceedings of the Proceedings 9th International Conference on Quantum Simulation and Quantum Walks, 2020

2019
A Primer on Quantum Computing
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-19065-1, 2019

Discretization of continuous-time quantum walks via the staggered model with Hamiltonians.
Nat. Comput., 2019

The Tessellation Cover Number of Good Tessellable Graphs.
CoRR, 2019

2018
Element distinctness revisited.
Quantum Inf. Process., 2018

Partition-based discrete-time quantum walks.
Quantum Inf. Process., 2018

Quantum walks via quantum cellular automata.
Quantum Inf. Process., 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Exact simulation of coined quantum walks with the continuous-time model.
Quantum Inf. Process., 2017

Determining the Efficiency of Quantum Search Algorithms with the Renormalization Group.
CoRR, 2017

The tessellation problem of quantum walks.
CoRR, 2017

Parallel algorithms for modular multi-exponentiation.
Appl. Math. Comput., 2017

2016
The staggered quantum walk model.
Quantum Inf. Process., 2016

Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model.
Quantum Inf. Process., 2016

2015
Moments of coinless quantum walks on lattices.
Quantum Inf. Process., 2015

Quantum walks on a circle with optomechanical systems.
Quantum Inf. Process., 2015

Spatial search on grids with minimum memory.
Quantum Inf. Comput., 2015

An Efficient One-Bit Model for Differential Fault Analysis on Simon Family.
Proceedings of the 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2015

2014
Decoherence in quantum Markov chains.
Quantum Inf. Process., 2014

A new hybrid classical-quantum algorithm for continuous global optimization problems.
J. Glob. Optim., 2014

2013
Non-Pauli observables for CWS codes.
Quantum Inf. Process., 2013

2012
Spatial quantum search in a triangular network.
Math. Struct. Comput. Sci., 2012

Parallel modular exponentiation using load balancing without precomputation.
J. Comput. Syst. Sci., 2012

Decoder for Nonbinary CWS Quantum Codes
CoRR, 2012

2011
Quantum search algorithms on hierarchical networks.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

2010
Spatial search on a honeycomb network.
Math. Struct. Comput. Sci., 2010

Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition.
J. Comput. Appl. Math., 2010

Mixing Times in Quantum Walks on Two-Dimensional Grids.
CoRR, 2010

2009
Decoherence in Search Algorithms.
CoRR, 2009

Solutions to the Hidden Subgroup Problem on Some Metacyclic Groups.
Proceedings of the Theory of Quantum Computation, 2009

2008
The Invar tensor package: Differential invariants of Riemann.
Comput. Phys. Commun., 2008

The QWalk simulator of quantum walks.
Comput. Phys. Commun., 2008

2007
The Invar tensor package.
Comput. Phys. Commun., 2007

2006
Reversible Karatsuba's Algorithm.
J. Univers. Comput. Sci., 2006

2004
Genetic Algorithms and Quantum Computation
CoRR, 2004

1999
Computer algebra takes on the vibrating-membrane problem.
Comput. Sci. Eng., 1999


  Loading...