Zobrazeno 1 - 10
of 2 681
pro vyhledávání: '"Martín A. Miguel"'
Autor:
Melina Vladisauskas, Gabriel O. Paz, Verónica Nin, Jesús A. Guillén, Laouen Belloli, Hernán Delgado, Martín A. Miguel, Daniela Macario Cabral, Diego E. Shalom, Anna Forés, Alejandra Carboni, Diego Fernández-Slezak, Andrea P. Goldin
Publikováno v:
Brain Sciences, Vol 14, Iss 3, p 262 (2024)
Mate Marote is an open-access cognitive training software aimed at children between 4 and 8 years old. It consists of a set of computerized games specifically tailored to train and evaluate Executive Functions (EF), a class of processes critical for
Externí odkaz:
https://doaj.org/article/f97d707eed9d4f9ab5d796770f3f8578
This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR), unlocking new possibilities for quantum algorithm efficiency. We demonstrate how to adapt quantum circuits to these
Externí odkaz:
http://arxiv.org/abs/2410.22011
Testing graph completeness is a critical problem in computer science and network theory. Leveraging quantum computation, we present an efficient algorithm using the Szegedy quantum walk and quantum phase estimation (QPE). Our algorithm, which takes t
Externí odkaz:
http://arxiv.org/abs/2407.20069
We apply quantum homomorphic encryption (QHE) schemes suitable for circuits with a polynomial number of $T/T^{\dagger}$-gates to Grover's algorithm, performing a simulation in Qiskit of a Grover circuit that contains 3 qubits. The $T/T^{\dagger}$ gat
Externí odkaz:
http://arxiv.org/abs/2403.04922
Publikováno v:
Physical Review Research 6, 043014 (2024)
The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. However, this algorithm loses its functionality when the $N/M$ ratio between the network size $N$ and the number of marked nodes $
Externí odkaz:
http://arxiv.org/abs/2401.01554
Publikováno v:
Phys. Rev. Research 6, 013304 (2024)
Fracton codes host unconventional topological states of matter and are promising for fault-tolerant quantum computation due to their large coding space and strong resilience against decoherence and noise. In this work, we investigate the ground-state
Externí odkaz:
http://arxiv.org/abs/2311.11066
Publikováno v:
Advanced Quantum Technologies, 2400022, (2024)
Szegedy's quantum walk is an algorithm for quantizing a general Markov chain. It has plenty of applications such as many variants of optimizations. In order to check its properties in an error-free environment, it is important to have a classical sim
Externí odkaz:
http://arxiv.org/abs/2307.14314
Tumor vascularity detection and quantification are of high relevance in the assessment of cancer lesions not only for disease diagnostics but for therapy considerations and monitoring. The present work addressed the quantification of pharmacokinetic
Externí odkaz:
http://arxiv.org/abs/2305.12048
Publikováno v:
Physica A: Statistical Mechanics and its Applications 625, 129021 (2023)
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical and quantum
Externí odkaz:
http://arxiv.org/abs/2303.18202
The nonrecursive Bernstein-Vazirani algorithm was the first quantum algorithm to show a superpolynomial improvement over the corresponding best classical algorithm. Here we define a class of circuits that solve a particular case of this problem for s
Externí odkaz:
http://arxiv.org/abs/2303.17426