arXiv subjects

Nicola Mariella

Publications and source records attributed to Nicola Mariella.

6 recordsLinked to original sources

arXiv2026

Order Parameter Discovery for Quantum Many-Body Systems

Quantum phase transitions reveal deep insights into the behavior of many-body quantum systems, but identifying these transitions without prior knowledge of order parameters remains a significant challenge. In this work, we introduce a method for constructing phase diagrams using the vector field of the reduced fidelity susceptibility (RFS), and demonstrate how information encoded in this vector field can be used to discover observables corresponding to order parameters. We apply our approach to well-established models: the Axial Next Nearest Neighbour Interaction (ANNNI) model, a cluster state model, and a chain of Rydberg atoms; and validate the discovered order parameters using eigendecomposition and finite-size scaling analysis, confirming the expected universality classes. Our results demonstrate that the RFS vector field offers a unified framework for phase characterization and order-parameter discovery that requires no prior knowledge of symmetry or transition type, while relying only on reduced density matrices of small subsystems.

quant-ph↗

arXiv2025

Quantum Krylov Subspace Diagonalization via Time Reversal Symmetries

Krylov quantum diagonalization methods have emerged as a promising use case for quantum computers. However, many existing implementations rely on controlled operations, which pose challenges to near-term quantum hardware. We introduce a novel protocol, termed Krylov Time Reversal (KTR), that circumvents these bottlenecks by leveraging time-reversal symmetry in Hamiltonian evolution. Using symmetric time dynamics, we show that it is possible to recover real-valued Krylov matrix elements, which significantly reduces the circuit depth and enhances compatibility with shallow quantum architectures. Furthermore, the protocol's structure indirectly reduces the total evolution time, benefiting both near-term and long-term architectures. We validate our method through numerical simulations on paradigmatic Hamiltonians exhibiting time-reversal symmetry, including the transverse-field Ising model and a lattice gauge theory, demonstrating accurate spectral estimation and favorable circuit constructions.

quant-ph↗

arXiv2024

Quantum Theory and Application of Contextual Optimal Transport

Optimal Transport (OT) has fueled machine learning (ML) across many domains. When paired data measurements $(\boldsymbolμ, \boldsymbolν)$ are coupled to covariates, a challenging conditional distribution learning setting arises. Existing approaches for learning a $\textit{global}$ transport map parameterized through a potentially unseen context utilize Neural OT and largely rely on Brenier's theorem. Here, we propose a first-of-its-kind quantum computing formulation for amortized optimization of contextualized transportation plans. We exploit a direct link between doubly stochastic matrices and unitary operators thus unravelling a natural connection between OT and quantum computation. We verify our method (QontOT) on synthetic and real data by predicting variations in cell type distributions conditioned on drug dosage. Importantly we conduct a 24-qubit hardware experiment on a task challenging for classical computers and report a performance that cannot be matched with our classical neural OT approach. In sum, this is a first step toward learning to predict contextualized transportation plans through quantum computing.

cs.LG↗

arXiv2023

Towards quantum-enabled cell-centric therapeutics

In recent years, there has been tremendous progress in the development of quantum computing hardware, algorithms and services leading to the expectation that in the near future quantum computers will be capable of performing simulations for natural science applications, operations research, and machine learning at scales mostly inaccessible to classical computers. Whereas the impact of quantum computing has already started to be recognized in fields such as cryptanalysis, natural science simulations, and optimization among others, very little is known about the full potential of quantum computing simulations and machine learning in the realm of healthcare and life science (HCLS). Herein, we discuss the transformational changes we expect from the use of quantum computation for HCLS research, more specifically in the field of cell-centric therapeutics. Moreover, we identify and elaborate open problems in cell engineering, tissue modeling, perturbation modeling, and bio-topology while discussing candidate quantum algorithms for research on these topics and their potential advantages over classical computational approaches.

quant-ph↗

arXiv2022

A doubly stochastic matrices-based approach to optimal qubit routing

Swap mapping is a quantum compiler optimization that, by introducing SWAP gates, maps a logical quantum circuit to an equivalent physically implementable one. The physical implementability of a circuit is determined by the fulfillment of the hardware connectivity constraints. Therefore, the placement of the SWAP gates can be interpreted as a discrete optimization process. In this work, we employ a structure called doubly stochastic matrix, which is defined as a convex combination of permutation matrices. The intuition is that of making the decision process smooth. Doubly stochastic matrices are contained in the Birkhoff polytope, in which the vertices represent single permutation matrices. In essence, the algorithm uses smooth constrained optimization to slide along the edges of the polytope toward the potential solutions on the vertices. In the experiments, we show that the proposed algorithm, at the cost of additional computation time, can deliver significant depth reduction when compared to the state of the art algorithm SABRE.

quant-ph↗

arXiv2022

A Quantum Algorithm for the Sub-Graph Isomorphism Problem

We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number of qubits that scales logarithmically with the number of vertices of the graphs; and (2) on a new Ansatz that can efficiently probe the permutation space. Simulations are then presented to showcase the approach on graphs up to 16 vertices, whereas, given the logarithmic scaling, the approach could be applied to realistic sub-graph isomorphism problem instances in the medium term.

quant-ph↗