arXiv subjects

Carlo Cosenza

Publications and source records attributed to Carlo Cosenza.

4 recordsLinked to original sources

arXiv2026

Quantum Circuit-Based Adaptation for Credit Risk Analysis

Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation. Hence, quantum algorithms designed in the pre-faulttolerant era cannot neglect the noisy nature of the hardware, and investigating the relationship between quantum hardware performance and the output of quantum algorithms is essential. In this work, we experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis, e.g., standard Gaussian distributions for latent factor loading in the Gaussian Conditional- Independence model. We use a transpilation technique tailored to the specific quantum hardware topology, which minimizes gate depth and connectivity violations, and we calibrate the gate rotations of the circuit to achieve an optimized output from quantum algorithms. Our results demonstrate the viability of quantum adaptation on a small scale, proof-of-concept model inspired by financial applications and offer a good starting point for understanding the practical use of NISQ devices.

quant-ph↗

arXiv2026

Experimental observation of dynamical blockade between transmon qubits via ZZ interaction engineering

We report the experimental realization of strong longitudinal (ZZ) coupling between two superconducting transmon qubits achieved solely through capacitive engineering. By systematically varying the qubit frequency detuning, we measure cross-Kerr inter-qubit interaction strengths ranging from 10 MHz up to 350 MHz, more than an order of magnitude larger than previously observed in similar capacitively coupled systems. In this configuration, the qubits enter a strong-interaction regime in which the excitation of one qubit inhibits that of its neighbor, demonstrating a dynamical blockade mediated entirely by the engineered ZZ coupling. Circuit quantization simulations accurately reproduce the experimental results, while perturbative models confirm the theoretical origin of the energy shift as a hybridization between the computational states and higher-excitation manifolds. We establish a robust and scalable method to access interaction-dominated physics in superconducting circuits, providing a pathway towards solid-state implementations of globally controlled quantum architectures and cooperative many-body dynamics.

quant-ph↗

arXiv2025

Experimental demonstration of non-local magic in a superconducting quantum processor

Non-local magic is the non-stabilizerness that no local unitary operation can erase. It captures the joint action of entanglement and magic underlying quantum advantage, and it has never been measured on quantum hardware. Here we report its first experimental demonstration, on a superconducting quantum processing unit, through two independent routes: an optimal local-erasure protocol and a direct, state-agnostic measurement of subsystem purity. The two agree with each other and with theory. Exploiting direct access to the device, we construct a noise model with no free parameters that identifies readout error and a depolarizing controlled-Z channel as the dominant mechanisms, and we show that local and non-local magic can be addressed separately, erasing local magic in situ while preserving the non-local part. Non-local magic provides a hardware benchmark beyond standard gate-fidelity protocols and points toward more reliable pre-fault tolerant devices.The same tools underlie a purity-estimation protocol with exponential speedup and the decoding of Hawking radiation in a black-hole toy model.

quant-ph↗

arXiv2025

Implementation and readout of maximally entangled two-qubit gates quantum circuits in a superconducting quantum processor

Besides noticeable challenges in implementing low-error single- and two-qubit quantum gates in superconducting quantum processors, the readout technique and analysis are a key factor in determining the efficiency and performance of quantum processors. Being able to efficiently implement quantum algorithms involving entangling gates and asses their output is mandatory for quantum utility. In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity, from single-qubit circuits to maximally entangled Bell circuits. This comparison highlighted the importance of the readout analysis and helped us optimize the protocol for more advanced quantum algorithms. Here we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms, referred to as "multiplied readout probabilities" and "conditional readout probabilities". The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.

quant-ph↗