Searcharxiv⌕ Search

arXiv subjects

Andrea D'Urbano

Publications and source records attributed to Andrea D'Urbano.

4 recordsLinked to original sources

Lindblad Multiproduct Formulas

We introduce Lindblad Multiproduct Formulas: a quantum error mitigation technique that uses two-dimensional tensor networks contracted with loop-corrected belief propagation. The quantities required to implement the error mitigation scheme that are evaluated with tensor networks can be less computationally expensive to calculate than the expectation values themselves, thus allowing for the possibility of applying our method to certain systems for which tensor network methods may struggle to calculate the observable quantities of interest. The workflow incorporates Clifford rescaling techniques and outputs an estimated error bar. We apply our method to a model of two-dimensional discrete time crystals studied previously and implement it on $65$ qubits arranged in a $3\!\times\!3$ heavy-hexagonal topology on the quantum computer ibm_basquecountry. We show that a GPU implementation of the classical part of our workflow achieves a speedup of up to $5.6\times$.

quant-ph↗

Realization of Two-dimensional Discrete Time Crystals with Anisotropic Heisenberg Coupling

A discrete time crystal (DTC) is the paradigmatic example of a phase of matter that occurs exclusively in systems out of equilibrium. This phenomenon is characterized by the spontaneous symmetry breaking of discrete time-translation and provides a rich playground to study a fundamental question in statistical physics: what mechanism allows for driven quantum systems to exhibit emergent behavior that deviates from their counterparts with time-independent evolution? Unlike equilibrium phases, DTCs exhibit macroscopic manifestations of coherent quantum dynamics, challenging the conventional narrative that thermodynamic behavior universally erases quantum signatures. However, due to the difficulty of simulating these systems with either classical or quantum computers, previous studies have been limited to a set of models with Ising-like couplings -- and mostly only in one dimension -- thus precluding our understanding of the existence (or not) of DTCs in models with interactions that closely align with what occurs in nature. In this work, by combining the latest generation of IBM quantum processors with state-of-the-art tensor network methods, we are able to demonstrate the existence of a DTC in a two-dimensional system governed by anisotropic Heisenberg interactions. Our comprehensive analysis reveals a rich phase diagram encompassing spin-glass, ergodic, and time-crystalline phases, highlighting the tunability of these phases through multiple control parameters. Crucially, our results emphasize the interplay of initialization, interaction anisotropy, and driving protocols in stabilizing the DTC phase. By extending the study of Floquet matter beyond simplified models, we lay the groundwork for exploring how driven systems bridge the gap between quantum coherence and emergent non-equilibrium thermodynamics.

quant-ph↗

Tensor Network enhanced Dynamic Multiproduct Formulas

Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We introduce a novel algorithm that combines tensor networks and quantum computation to produce results that are more accurate than what could be achieved by either method used in isolation. Our algorithm is based on multiproduct formulas (MPF) - a technique that linearly combines Trotter product formulas to reduce algorithmic error. Our algorithm uses a quantum computer to calculate the expectation values and tensor networks to calculate the coefficients used in the linear combination. We present a detailed error analysis of the algorithm and demonstrate the full workflow on a one-dimensional quantum simulation problem on $50$ qubits using two IBM quantum computers: $ibm\_torino$ and $ibm\_kyiv$.

quant-ph↗

Bridging Resource Theory and Quantum Key Distribution: Geometric Analysis and Statistical Testing

Discerning between quantum and classical correlations is of great importance. Bell polytopes are well established as a fundamental tool. In this paper, we extend this line of inquiry by applying resource theory within the context of Network scenarios, to a Quantum Key Distribution (QKD) protocol. To achieve this, we consider the causal structure $P3$ that can describe the protocol, and we aim to develop useful statistical tests to assess it. More concretely, our objectives are twofold: firstly, to utilise the underlying causal structure of the QKD protocol to obtain a geometrical analysis of the resulting non-convex polytope, with a focus on the classical behaviours. Second, we devise a test within this framework to evaluate the distance between any two behaviours within the generated polytope. This approach offers a unique perspective, linking deviations from expected behaviour directly to the quality of the quantum resource or the residual nonclassicality in protocol execution.

quant-ph↗