Skip to main content

TECNOLOGIAS CLAVE PARA COMPUTACION CUANTICA

PID2021-122547NB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2021
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD COMPLUTENSE DE MADRID

Resultados relacionados

Resultados totales (Incluyendo duplicados): 12
Encontrada(s) 1 página(s)

Docta Complutense
Publication Artículo científico (JournalArticle)

Quantum Bayesian Inference with renormalization for gravitational waves

  • Escrig, Gabriel
  • Campos, Roberto
  • Qi, Hong
  • Martín-Delgado Alcántara, Miguel Ángel
Advancements in gravitational-wave (GW) interferometers, particularly the next generation, are poised to enable the detections of orders of magnitude more GWs from compact binary coalescences. While the surge in detections will profoundly advance GW astronomy and multimessenger astrophysics, it also poses significant computational challenges in parameter estimation. In this work, we introduce a hybrid quantum algorithm qBIRD, which performs quantum Bayesian inference with renormalization and downsampling to infer GW parameters. We validate the algorithm using both simulated and observed GWs from binary black hole mergers on quantum simulators, demonstrating that its accuracy is comparable to classical Markov Chain Monte Carlo methods. Currently, our analyses focus on a subset of parameters, including chirp mass and mass ratio, due to the limitations from classical hardware in simulating quantum algorithms. However, qBIRD can accommodate a broader parameter space when the constraints are eliminated with a small-scale quantum computer of sufficient logical qubits.
Docta Complutense
Publication Artículo preliminar (WorkingPaper)

Resource-scalable fully quantum metropolis-hastings for integer linear programming

  • Escrig, Gabriel
  • Campos, Roberto
  • Martín-Delgado Alcántara, Miguel Ángel
Integer linear programming (ILP) remains computationally challenging due to its NP-complete nature despite its central role in scheduling, logistics, and design optimization. We introduce a fully quantum Metropolis-Hastings algorithm for ILP that implements a coherent random walk over the discrete feasible region using only reversible quantum circuits, without quantum-RAM assumptions or classical pre/post-processing. Each walk step is a unitary update that prepares coherent candidate moves, evaluates the objective and constraints reversibly -- including a constraint-satisfaction counter to enforce feasibility -- and encodes Metropolis acceptance amplitudes via a low-overhead linearized rule. At the logical level, the construction uses (nlog2N) qubits to represent n integer variables over the interval [−N,N−1], and the Toffoli-equivalent cost per Metropolis step grows linearly with the total logical qubit count. Using explicit ripple-carry adder constructions, we support linear objectives and mixed equality/inequality constraints. Numerical circuit-level simulations on a broad ensemble of randomly generated instances validate the predicted linear resource scaling and exhibit progressive thermalization toward low-cost feasible solutions under the annealing schedule. Overall, the method provides a coherent, resource-characterized baseline for fully quantum constraint programming and a foundation for incorporating additional quantum speedups in combinatorial optimization.
Docta Complutense
Publication Artículo científico (JournalArticle)

Correlated and critical phenomena in multipartite quantum non-Markovianity

  • González Castro, Ignacio
  • Rivas Vargas, Ángel
We study non-Markovianity in the exact dynamics of two two-level atoms in a resonant cavity. We find a critical behavior in the form of a Markovian to non-Markovian transition at a finite interatomic distance and a discontinuity in the limit of infinitely close atoms. Actually, in this highly correlated regime, we find that non-Markovianity always arises if the system size exceeds a critical threshold. To this end, a nonsingular, additive non-Markovian measure with appropriate asymptotic behavior is formulated. These results show how inter-subsystem distance and system size can act as precise controls for modulating memory effects in multipartite open quantum systems.
Docta Complutense
Publication Artículo científico (JournalArticle)

Complex-phase extensions of the Szegedy quantum walk on graphs

  • Ortega, Sergio A.
  • Martín-Delgado Alcántara, Miguel Ángel
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 advancements, allowing phase patterns that ensure computational practicality. The graph-phased model broadens the known equivalence between coined quantum walks and Szegedy's model, accommodating a wider array of coin operators. Through illustrative examples, we reveal intriguing disparities between classical and quantum interpretations of walk dynamics. Remarkably, local APR phases emerge as powerful tools for marking graph nodes, optimizing quantum searches without altering graph structure. We further explore the surprising nuances between single and double operator approaches, highlighting a greater range of compatible coins with the latter. To facilitate these advancements, we present an improved classical simulation algorithm, which operates with superior efficiency. This study not only refines quantum walk methodologies but also paves the way for future explorations, including potential applications in quantum search and PageRank algorithms. Our findings illuminate the path towards more versatile and powerful quantum computing paradigms.
Docta Complutense
Publication Artículo científico (JournalArticle)

Exotic symmetry breaking properties of self-dual fracton spin models

  • Canossa, Giovanni
  • Pollet, Lode
  • Martín-Delgado Alcántara, Miguel Ángel
  • Song, Hao
  • Liu, Ke
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 paper, we investigate the ground-state properties and phase transitions of two prototypical self-dual fracton spin models—the tetrahedral Ising model and the fractal Ising model—which correspond to error-correction procedures for the representative fracton codes of type I and type II, the checkerboard code and the Haah's code, respectively, in the error-free limit. They are endowed with exotic symmetry-breaking properties that contrast sharply with the spontaneous breaking of global symmetries and deconfinement transition of gauge theories. To show these unconventional behaviors, which are associated with subdimensional symmetries, we construct and analyze the order parameters, correlators, and symmetry generators for both models. Notably, the tetrahedral Ising model acquires an extended semilocal ordering moment, while the fractal Ising model fits into a polynomial ring representation and leads to a fractal order parameter. Numerical studies combined with analytical tools show that both models experience a strong first-order phase transition with an anomalous 𝐿−(𝐷−1) scaling, despite the fractal symmetry of the latter. Our paper provides a unique understanding of subdimensional symmetry breaking and makes an important step for studying quantum-error-correction properties of the checkerboard and Haah's codes.
Docta Complutense
Publication Artículo preliminar (WorkingPaper)

Reverse delegated training and private inference via perfectly-secure quantum homomorphic encryption

  • Ortega, Sergio A.
  • Martín-Delgado Alcántara, Miguel Ángel
Quantum machine learning in cloud environments requires protecting sensitive data while enabling remote computation. Here we demonstrate the first realistic implementations of a perfectly-secure quantum homomorphic encryption (QHE) scheme applied to quantum neural networks (QNN). Using efficient Clifford+T decomposition, we implement quantum convolutional neural networks for two complementary scenarios: (i) reverse delegated training, where encrypted data from multiple providers trains a user's network via federated aggregation; (ii) private inference, where users process encrypted data with remote quantum networks. Moreover, analysis of server circuit privacy reveals probabilistic model protection through Pauli gate concealment. These results establish perfectly-secure QHE as a practical framework for multi-party quantum machine learning
Docta Complutense
Publication Artículo científico (JournalArticle)

Homomorphic encryption of the k=2 Bernstein–Vazirani algorithm

  • Fernández Ortiz, Pablo
  • Martín-Delgado Alcántara, Miguel Ángel
We introduce a class of circuits that solve a particular case of the Bernstein-Vazirani recursive problem for second-level recursion. This class of circuits allows for the implementation of the oracle using a number of T-gates that grows linearly with the number of qubits in the problem. We find an application of this scheme to quantum homomorphic encryption (QHE), which is an important cryptographic technology useful for delegated quantum computing, allowing a remote server to perform quantum computations on encrypted quantum data, so that the server cannot know anything about the client's data. Liang's QHE schemes are suitable for circuits with a polynomial number of gates T/T† dagger. Thus, the simplified circuits we have constructed can be evaluated homomorphically in an efficient manner.
Docta Complutense
Publication Artículo preliminar (WorkingPaper)

From Hilbert's tenth problem to quantum speedup: explicit oracles for bounded diophantine systems

  • Escrig, Gabriel
  • Martín-Delgado Alcántara, Miguel Ángel
Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the worst case. In this work, we introduce a fully reversible quantum algorithmic framework tailored to solve arbitrary polynomial Diophantine equations over bounded integer domains. The core of our approach is the explicit, gate-level synthesis of an evaluation oracle for amplitude amplification. By coherently evaluating polynomial constraints via in-place two's complement arithmetic and routing operations into a single recycled accumulator, this garbage-free strategy achieves a compact and scalable synthesis of the underlying non-linear arithmetic. Through analytical derivations and empirical circuit simulations, we prove that the overall spatial complexity is bounded by q=((n+d2)log2N) logical qubits for n variables, maximum degree d, and interval length N. The non-Clifford Toffoli depth is upper-bounded by (q2). This structural scaling exponent remains invariant to the variable count, modulated linearly only by the coefficients' Hamming weights. By moving beyond abstract black-box assumptions, this explicit architectural synthesis guarantees that the necessary quantum arithmetic acts as a bounded polynomial overhead. This ensures a quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions.
Docta Complutense
Publication Artículo científico (JournalArticle)

Hybrid reward-driven reinforcement learning for efficient quantum circuit synthesis

  • Giordano, Sara
  • Sen, Kornikar
  • Martín-Delgado Alcántara, Miguel Ángel
A reinforcement learning (RL) framework is introduced for the efficient synthesis of quantum circuits that generate specified target quantum states from a fixed initial state, addressing a central challenge in both the Noisy Intermediate-Scale Quantum (NISQ) era and future fault-tolerant quantum computing. The approach utilizes tabular Q-learning, based on action sequences, within a discretized quantum state space, to effectively manage the exponential growth of the space dimension. The framework introduces a hybrid reward mechanism, combining a static, domain-informed reward that guides the agent toward the target state with customizable dynamic penalties that discourage inefficient circuit structures such as gate congestion and redundant state revisits. This is a circuit-aware reward, in contrast to the current trend of works on this topic, which are primarily fidelity-based. By leveraging sparse matrix representations and state-space discretization, the method enables practical navigation of high-dimensional environments while minimizing computational overhead. Benchmarking on graph-state preparation tasks for up to seven qubits, we demonstrate that the algorithm consistently discovers minimal-depth circuits with optimized gate counts. Moreover, extending the framework to a universal gate set still yields low depth circuits, highlighting the algorithm’s robustness and adaptability. The results confirm that this RL-driven approach, with our completely circuit-aware method, efficiently explores the complex quantum state space and synthesizes near-optimal quantum circuits, providing a resource-efficient foundation for quantum circuit optimization.
Docta Complutense
Publication Artículo científico (JournalArticle)

SQUWALS: a Szegedy QUantum WALks Simulator

  • Ortega, Sergio A.
  • Martín-Delgado Alcántara, Miguel Ángel
Szegedy’s quantum walk is an algorithm for quantizing a general Markovchain. It has plenty of applications, such as many variants of optimizations. Inorder to check its properties in an error-free environment, it is important tohave a classical simulator. However, the current simulation algorithms requirea great deal of memory due to the particular formulation of this quantumwalk. In this paper, a memory-saving algorithm is proposed that scales as(N2 ) with the size N of the graph. Additional procedures are provided forsimulating Szegedy’s quantum walk over mixed states and also theSemiclassical Szegedy walk. With these techniques, a classical simulator inPython called SQUWALS (Szegedy QUantum WALks Simulator) has beenbuilt. It is shown that the simulator scales as (N2 ) in both time and memoryresources. This package provides some high-level applications for algorithmsbased on Szegedy’s quantum walk, as for example the quantum PageRank
Docta Complutense
Publication Artículo científico (JournalArticle)

Quantum algorithm for testing graph completeness

  • Giordano, Sara
  • Martín-Delgado Alcántara, Miguel Ángel
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 the number of nodes and the adjacency matrix as input, constructs a quantum walk operator and applies QPE to estimate its eigenvalues. These eigenvalues reveal the graph’s structural properties, enabling us to determine its completeness. We establish a relationship between the number of nodes in a complete graph and the number of marked nodes, optimizing the success probability and running time. The time complexity of our algorithm is (log2 𝑛), where 𝑛 is the number of nodes of the graph. offering a clear quantum advantage over classical methods. This approach is useful in network structure analysis, evaluating classical routing algorithms, and assessing systems based on pairwise comparisons.
Docta Complutense
Publication Artículo científico (JournalArticle)

Randomized SearchRank: a semiclassical approach to a quantum search engine

  • Ortega, Sergio A.
  • Martín-Delgado Alcántara, Miguel Ángel
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 𝑁/𝑀 ratio between the network size 𝑁 and the number of marked nodes 𝑀 is sufficiently large. We propose a modification of the algorithm, replacing the underlying Szegedy quantum walk with a semiclassical walk. To maintain the same time complexity as the quantum SearchRank algorithm we propose a simplification of the algorithm. This new algorithm is called randomized SearchRank, since it corresponds to a quantum walk over a randomized mixed state. The performance of the SearchRank algorithms is first analyzed on an example network and then statistically on a set of different networks of increasing size and different number of marked nodes. On the one hand, to test the search ability of the algorithms, it is computed how the probability of measuring the marked nodes decreases with 𝑁/𝑀 for the quantum SearchRank, but remarkably it remains at a high value around 0.9 for our semiclassical algorithms, solving the quantum SearchRank problem. The time complexity of the algorithms is also analyzed, obtaining a quadratic speedup with respect to the classical ones. On the other hand, the ranking functionality of the algorithms has been investigated, obtaining a good agreement with the classical PageRank distribution. Finally, the dependence of these algorithms on the intrinsic PageRank damping parameter has been clarified. Our results suggest that this parameter should be below a threshold so that the execution time does not increase drastically.