arXiv subjects

M. A. Martin-Delgado

Publications and source records attributed to M. A. Martin-Delgado.

At least 19 recordsLinked to original sources

arXiv2026

From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems

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 = \mathcal{O}((n + d^2)\log_2 N)$ logical qubits for $n$ variables, maximum degree $d$, and interval length $N$. The non-Clifford Toffoli depth is upper-bounded by $\mathcal{O}(q^2)$. 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.

quant-ph↗

arXiv2026

Resource-Scalable Fully Quantum Metropolis-Hastings for Integer Linear Programming

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 $\mathcal{O}(n\log_2 N)$ 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.

quant-ph↗

arXiv2025

Quantum Bayesian Inference with Renormalization for Gravitational Waves

Advancements in gravitational-wave interferometers, particularly the next generation, are poised to profoundly impact gravitational wave astronomy and multimessenger astrophysics. A hybrid quantum algorithm is proposed to carry out quantum inference of parameters from compact binary coalescences detected in gravitational-wave interferometers. It performs quantum Bayesian Inference with Renormalization and Downsampling (qBIRD). We choose binary black hole (BBH) mergers from LIGO observatories as the first case to test the algorithm, but its application can be extended to more general instances. The quantum algorithm is able to generate corner plots of relevant parameters such as chirp mass, mass ratio, spins, etc. by inference of simulated gravitational waves with known injected parameter values with zero noise, Gaussian noise and real data, thus recovering an accuracy equivalent to that of classical Markov Chain Monte Carlo inferences. The simulations are performed with sets of 2 and 4 parameters. These results enhance the possibilities to extend our capacity to track signals from coalescences over longer durations and at lower frequencies extending the accuracy and promptness of gravitational wave parameter estimation.

quant-ph↗

arXiv2023

Parameter Estimation of Gravitational Waves with a Quantum Metropolis Algorithm

After the first detection of a gravitational wave in 2015, the number of successes achieved by this innovative way of looking through the universe has not stopped growing. However, the current techniques for analyzing this type of events present a serious bottleneck due to the high computational power they require. In this article we explore how recent techniques based on quantum algorithms could surpass this obstacle. For this purpose, we propose a quantization of the classical algorithms used in the literature for the inference of gravitational wave parameters based on the well-known Quantum Walks technique applied to a Metropolis-Hastings algorithm. Finally, we develop a quantum environment on classical hardware, implementing a metric to compare quantum versus classical algorithms in a fair way. We further test all these developments in the real inference of several sets of parameters of all the events of the first detection period GWTC-1 and we find a polynomial advantage in the quantum algorithms, thus setting a first starting point for future algorithms.

gr-qc↗

arXiv2023

Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer

There is a pressing need to develop new rechargeable battery technologies that can offer higher energy storage, faster charging, and lower costs. Despite the success of existing methods for the simulation of battery materials, they can sometimes fall short of delivering accurate and reliable results. Quantum computing has been discussed as an avenue to overcome these issues, but only limited work has been done to outline how they may impact battery simulations. In this work, we provide a detailed answer to the following question: how can a quantum computer be used to simulate key properties of a lithium-ion battery? Based on recently-introduced first-quantization techniques, we lay out an end-to-end quantum algorithm for calculating equilibrium cell voltages, ionic mobility, and thermal stability. These can be obtained from ground-state energies of materials, which is the core calculation executed by the quantum computer using qubitization-based quantum phase estimation. The algorithm includes explicit methods for preparing approximate ground states of periodic materials in first quantization. We bring these insights together to perform the first estimation of the resources required to implement a quantum algorithm for simulating a realistic cathode material, dilithium iron silicate.

quant-ph↗

arXiv2022

Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry

Fracton models provide examples of novel gapped quantum phases of matter that host intrinsically immobile excitations and therefore lie beyond the conventional notion of topological order. Here, we calculate optimal error thresholds for quantum error correcting codes based on fracton models. By mapping the error-correction process for bit-flip and phase-flip noises into novel statistical models with Ising variables and random multi-body couplings, we obtain models that exhibit an unconventional subsystem symmetry instead of a more usual global symmetry. We perform large-scale parallel tempering Monte Carlo simulations to obtain disorder-temperature phase diagrams, which are then used to predict optimal error thresholds for the corresponding fracton code. Remarkably, we found that the X-cube fracton code displays a minimum error threshold ($7.5\%$) that is much higher than 3D topological codes such as the toric code ($3.3\%$), or the color code ($1.9\%$). This result, together with the predicted absence of glass order at the Nishimori line, shows great potential for fracton phases to be used as quantum memory platforms.

quant-ph↗

arXiv2022

TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry

Quantum Phase Estimation is one of the most useful quantum computing algorithms for quantum chemistry and as such, significant effort has been devoted to designing efficient implementations. In this article, we introduce TFermion, a library designed to estimate the T-gate cost of such algorithms, for an arbitrary molecule. As examples of usage, we estimate the T-gate cost of a few simple molecules and compare the same Taylorization algorithms using Gaussian and plane-wave basis.

quant-ph↗

arXiv2020

A quantum active learning algorithm for sampling against adversarial attacks

Adversarial attacks represent a serious menace for learning algorithms and may compromise the security of future autonomous systems. A theorem by Khoury and Hadfield-Menell (KH), provides sufficient conditions to guarantee the robustness of machine learning algorithms, but comes with a caveat: it is crucial to know the smallest distance among the classes of the corresponding classification problem. We propose a theoretical framework that allows us to think of active learning as sampling the most promising new points to be classified, so that the minimum distance between classes can be found and the theorem KH used. Additionally, we introduce a quantum active learning algorithm that makes use of such framework and whose complexity is polylogarithmic in the dimension of the space, $m$, and the size of the initial training data $n$, provided the use of qRAMs; and polynomial in the precision, achieving an exponential speedup over the equivalent classical algorithm in $n$ and $m$. This algorithm may be nevertheless `dequantized' reducing the advantage to polynomial.

quant-ph↗

arXiv2020

A Quantum Interior-Point Predictor-Corrector Algorithm for Linear Programming

We introduce a new quantum optimization algorithm for dense Linear Programming problems, which can be seen as the quantization of the Interior Point Predictor-Corrector algorithm \cite{Predictor-Corrector} using a Quantum Linear System Algorithm \cite{DenseHHL}. The (worst case) work complexity of our method is, up to polylogarithmic factors, $O(L\sqrt{n}(n+m)\overline{||M||_F}\barκ^2ε^{-2})$ for $n$ the number of variables in the cost function, $m$ the number of constraints, $ε^{-1}$ the target precision, $L$ the bit length of the input data, $\overline{||M||_F}$ an upper bound to the Frobenius norm of the linear systems of equations that appear, $||M||_F$, and $\barκ$ an upper bound to the condition number $κ$ of those systems of equations. This represents a quantum speed-up in the number $n$ of variables in the cost function with respect to the comparable classical Interior Point algorithms when the initial matrix of the problem $A$ is dense: if we substitute the quantum part of the algorithm by classical algorithms such as Conjugate Gradient Descent, that would mean the whole algorithm has complexity $O(L\sqrt{n}(n+m)^2\barκ \log(ε^{-1}))$, or with exact methods, at least $O(L\sqrt{n}(n+m)^{2.373})$. Also, in contrast with any Quantum Linear System Algorithm, the algorithm described in this article outputs a classical description of the solution vector, and the value of the optimal solution.

quant-ph↗

arXiv2019

Quench dynamics and zero-energy modes: the case of the Creutz model

In most lattice models, the closing of a band gap typically occurs at high-symmetry points in the Brillouin zone. Differently, in the Creutz model $-$ describing a system of spinless fermions hopping on a two-leg ladder pierced by a magnetic field $-$ the gap closing at the quantum phase transition between the two topologically nontrivial phases of the model can be moved by tuning the hopping amplitudes. We take advantage of this property to examine the nonequilibrium dynamics of the model after a sudden quench of the magnetic flux through the plaquettes of the ladder. For a quench to one of the equilibrium quantum critical points we find that the revival period of the Loschmidt echo $-$ measuring the overlap between initial and time-evolved states $-$ is controlled by the gap closing zero-energy modes. In particular, and contrary to expectations, the revival period of the Loschmidt echo for a finite ladder does not scale linearly with size but exhibits jumps determined by the presence or absence of zero-energy modes. We further investigate the conditions for the appearance of dynamical quantum phase transitions in the model and find that, for a quench {\em to} an equilibrium critical point, such transitions occur only for ladders of sizes which host zero-energy modes. Exploiting concepts from quantum thermodynamics, we show that the average work and the irreversible work per lattice site exhibit a weak dependence on the size of the system after a quench {\em across} an equilibrium critical point, suggesting that quenching into a different phase induces effective correlations among the particles.

quant-ph↗

arXiv2018

Twisted Fracton Models in Three Dimensions

We study novel three-dimensional gapped quantum phases of matter which support quasiparticles with restricted mobility, including immobile "fracton" excitations. So far, most existing fracton models may be instructively viewed as generalized Abelian lattice gauge theories. Here, by analogy with Dijkgraaf-Witten topological gauge theories, we discover a natural generalization of fracton models, obtained by twisting the gauge symmetries. Introducing generalized gauge transformation operators carrying an extra phase factor depending on local configurations, we construct a plethora of exactly solvable three-dimensional models, which we dub "twisted fracton models." A key result of our approach is to demonstrate the existence of rich non-Abelian fracton phases of distinct varieties in a three-dimensional system with finite-range interactions. For an accurate characterization of these novel phases, the notion of being inextricably non-Abelian is introduced for fractons and quasiparticles with one-dimensional mobility, referring to their new behavior of displaying braiding statistics that is, and remains, non-Abelian regardless of which quasiparticles with higher mobility are added to or removed from them. We also analyze these models by embedding them on a three-torus and computing their ground state degeneracies, which exhibit a surprising and novel dependence on the system size in the non-Abelian fracton phases. Moreover, as an important advance in the study of fracton order, we develop a general mathematical framework which systematically captures the fusion and braiding properties of fractons and other quasiparticles with restricted mobility.

cond-mat.str-el↗

arXiv2018

Staircase to Higher-Order Topological Phase Transitions

We find a series of topological phase transitions of increasing order, beyond the more standard second-order phase transition in a one-dimensional topological superconductor. The jumps in the order of the transitions depend on the range of the pairing interaction, which is parametrized by an algebraic decay with exponent $α$. Remarkably, in the limit $α= 1$ the order of the topological transition becomes infinite. We compute the critical exponents for the series of higher-order transitions in exact form and find that they fulfill the hyperscaling relation. We also study the critical behaviour at the boundary of the system and discuss potential experimental platforms of magnetic atoms in superconductors.

cond-mat.stat-mech↗

arXiv2018

Twins Percolation for Qubit Losses in Topological Color Codes

We establish and explore a new connection between quantum information theory and classical statistical mechanics by studying the problem of qubit losses in 2D topological color codes. We introduce a protocol to cope with qubit losses, which is based on the identification and removal of a twin qubit from the code, and which guarantees the recovery of a valid three-colorable and trivalent reconstructed color code lattice. Moreover, we show that determining the corresponding qubit loss error threshold is equivalent to a new generalized classical percolation process. We numerically compute the associated qubit loss thresholds for two families of 2D color code and find that these are close to satisfying the fundamental limit $p_\text{fund} = 0.461 \pm 0.005$ close to the 50% as imposed by the no-cloning theorem. Our findings reveal a new connection between topological color codes and percolation theory, show high robustness of color codes against qubit loss, and are relevant for implementations of quantum error correction in various physical platforms.

quant-ph↗

arXiv2018

Observation of topological Uhlmann phases with superconducting qubits

Topological insulators and superconductors at finite temperature can be characterized by the topological Uhlmann phase. However, a direct experimental measurement of this invariant has remained elusive in condensed matter systems. Here, we report a measurement of the topological Uhlmann phase for a topological insulator simulated by a system of entangled qubits in the IBM Quantum Experience platform. By making use of ancilla states, otherwise unobservable phases carrying topological information about the system become accessible, enabling the experimental determination of a complete phase diagram including environmental effects. We employ a state-independent measurement protocol which does not involve prior knowledge of the system state. The proposed measurement scheme is extensible to interacting particles and topological models with a large number of bands.

quant-ph↗

arXiv2016

Topological Massive Dirac Edge Modes and Long-Range Superconducting Hamiltonians

We discover novel topological effects in the one-dimensional Kitaev chain modified by long-range Hamiltonian deformations in the hopping and pairing terms. This class of models display symmetry-protected topological order measured by the Berry/Zak phase of the lower band eigenvector and the winding number of the Hamiltonians. For exponentially-decaying hopping amplitudes, the topological sector can be significantly augmented as the penetration length increases, something experimentally achievable. For power-law decaying superconducting pairings, the massless Majorana modes at the edges get paired together into a massive non-local Dirac fermion localised at both edges of the chain: a new topological quasiparticle that we call topological massive Dirac fermion. This topological phase has fractional topological numbers as a consequence of the long-range couplings. Possible applications to current experimental setups and topological quantum computation are also discussed.

cond-mat.str-el↗

arXiv2016

A bilayer Double Semion Model with Symmetry-Enriched Topological Order

We construct a new model of two-dimensional quantum spin systems that combines intrinsic topo- logical orders and a global symmetry called flavour symmetry. It is referred as the bilayer Doubled Semion model (bDS) and is an instance of symmetry-enriched topological order. A honeycomb bi- layer lattice is introduced to combine a Double Semion Topolgical Order with a global spin-flavour symmetry to get the fractionalization of its quasiparticles. The bDS model exhibits non-trival braid- ing self-statistics of excitations and its dual model constitutes a Symmetry-Protected Topological Order with novel edge states. This dual model gives rise to a bilayer Non-Trivial Paramagnet that is invariant under the flavour symmetry and the well-known spin flip symmetry.

cond-mat.str-el↗

arXiv2016

Iterative Phase Optimisation of Elementary Quantum Error Correcting Codes

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as errors can be fully characterized. For multi-qubit operations, though, this is no longer the case as in the most general case analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g.~a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum information processing.

quant-ph↗

arXiv2016

Quantum Enhanced Energy Distribution for Information Heat Engines

A new scenario for energy distribution, security and shareability is presented that assumes the availability of quantum information heat engines and a thermal bath. It is based on the convertibility between entropy and work in the presence of a thermal reservoir. Our approach to the informational content of physical systems that are distributed between users is complementary to the conventional perspective of quantum communication. The latter places the value on the unpredictable content of the transmitted quantum states, while our interest focuses on their certainty. Some well-known results in quantum communication are reused in this context. Particularly, we describe a way to securely distribute quantum states to be used for unlocking energy from thermal sources. We also consider some multi-partite entangled and classically correlated states for a collaborative multi-user sharing of work extraction possibilities. Besides, the relation between the communication and work extraction capabilities is analyzed and written as an equation.

quant-ph↗