Zobrazeno 1 - 10
of 1 549
pro vyhledávání: '"Delgado, Miguel A."'
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
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
Autor:
Martin-Delgado, Miguel A.
An argument is provided that confronts the strong equivalence principle (SEP) of general relativity with the superposition principle (SP) of quantum mechanics. The result has implications on the possibility of synthesizing Majorana bound states in 1D
Externí odkaz:
http://arxiv.org/abs/2303.03430
For many applications of probabilistic classifiers it is important that the predicted confidence vectors reflect true probabilities (one says that the classifier is calibrated). It has been shown that common models fail to satisfy this property, maki
Externí odkaz:
http://arxiv.org/abs/2210.03702
Autor:
Delgado, Miguel A., Vainora, Julius
This paper introduces chi-square goodness-of-fit tests to check for conditional distribution model specification. The data is cross-classified according to the Rosenblatt transform of the dependent variable and the explanatory variables, resulting in
Externí odkaz:
http://arxiv.org/abs/2210.00624