Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Veras, Tiago M. L."'
Autor:
de Carvalho, José A., Batista, Carlos A., de Veras, Tiago M. L., Araujo, Israel F., da Silva, Adenilton J.
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build them. Here
Externí odkaz:
http://arxiv.org/abs/2409.05618
Initializing classical data in a quantum device is an essential step in many quantum algorithms. As a consequence of measurement and noisy operations, some algorithms need to reinitialize the prepared state several times during its execution. In this
Externí odkaz:
http://arxiv.org/abs/2108.13527
Loading data in a quantum device is required in several quantum computing applications. Without an efficient loading procedure, the cost to initialize the algorithms can dominate the overall computational cost. A circuit-based quantum random access m
Externí odkaz:
http://arxiv.org/abs/2011.07977
We use a labelled deduction system ( LND$_{ED-}$TRS ) based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type, which allowed us to carry out in homotopic theory an approach using the concep
Externí odkaz:
http://arxiv.org/abs/2007.07769
Autor:
Sousa, Rodrigo S., Santos, Priscila G. M. dos, Veras, Tiago M. L., de Oliveira, Wilson R., da Silva, Adenilton J.
Publikováno v:
Neurocomputing 416 (2020): 360-369
Probabilistic Quantum Memory (PQM) is a data structure that computes the distance from a binary input to all binary patterns stored in superposition on the memory. This data structure allows the development of heuristics to speed up artificial neural
Externí odkaz:
http://arxiv.org/abs/2001.04798
In this work, we use a labelled deduction system based on the concept of computational paths (sequence of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between the
Externí odkaz:
http://arxiv.org/abs/1906.09107
We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these computatio
Externí odkaz:
http://arxiv.org/abs/1906.09105
Autor:
Batista, Carlos A.1,2 (AUTHOR) carlos.andrebatista@ufrpe.br, de Veras, Tiago M. L.3 (AUTHOR), da Silva, Leon D.3 (AUTHOR), da Silva, Adenilton J.1 (AUTHOR)
Publikováno v:
Quantum Information Processing. Nov2023, Vol. 22 Issue 11, p1-9. 9p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
de Veras, Tiago M. L.1,2 (AUTHOR) tiago.veras@ufrpe.br, da Silva, Leon D.1 (AUTHOR), da Silva, Adenilton J.2 (AUTHOR)
Publikováno v:
Quantum Information Processing. Jun2022, Vol. 21 Issue 6, p1-13. 13p.