arXiv subjects

Carlos A. Riofrío

Publications and source records attributed to Carlos A. Riofrío.

At least 19 recordsLinked to original sources

arXiv2026

Testing and Diagnosing Parameter Miscalibration in Probabilistic Error Cancellation via Direct Fidelity Estimation

Probabilistic Error Cancellation (PEC) is a standard technique for mitigating noise in quantum computations, but its unbiasedness relies on accurate knowledge of the underlying noise parameters. In practice, these parameters are inferred from experimental data and may be inaccurate. We introduce a protocol that tests PEC parameter consistency on hardware by applying Direct Fidelity Estimation (DFE) to the effective mitigated state. The resulting DFE overlap serves not only as a witness of parameter miscalibration but, under appropriate conditions, also reveals whether the PEC parameters have been overestimated or underestimated. We establish this behavior for arbitrary circuits under global depolarizing noise and for Clifford circuits under general Pauli-stochastic noise. For arbitrary circuits subject to Pauli-stochastic noise, the underestimation result holds generally, while the corresponding overestimation result is established perturbatively for sufficiently small consistent miscalibrations under an additional nondegeneracy condition. We further show that the purity of the effective mitigated operator provides a more general diagnostic, allowing the miscalibration direction to be identified for arbitrary circuits and arbitrary parameter deviations. Finally, we describe a two-copy PEC procedure for measuring this quantity and show that, together with the DFE overlap, it determines the Hilbert-Schmidt distance from the ideal state. The sampling overhead incurred by our protocol is the same as that of PEC, and we discuss strategies to improve it.

quant-ph↗

arXiv2026

Scaling Quantum Machine Learning without Tricks: Full-Resolution and Diverse Image Generation

Quantum generative modeling is a rapidly evolving discipline at the intersection of quantum computing and machine learning. Contemporary quantum machine learning is generally limited to toy examples or heavily restricted datasets with few elements. This is not only due to the current limitations of available quantum hardware but also due to the absence of inductive biases arising from application-agnostic designs. Current quantum solutions must resort to tricks to scale down high-resolution images, such as relying heavily on dimensionality reduction or utilizing multiple quantum models for low-resolution image patches. Building on recent developments in classical image loading to quantum computers, we circumvent these limitations and train quantum Wasserstein GANs on the established classical MNIST and Fashion-MNIST datasets. Using the complete datasets, our system generates full-resolution images across all ten classes and establishes a new state-of-the-art performance with a single end-to-end quantum generator without tricks. As a proof-of-principle, we also demonstrate that our approach can be extended to color images, exemplified on the Street View House Numbers dataset. We analyze how the choice of variational circuit architecture introduces inductive biases, which crucially unlock this performance. Furthermore, enhanced noise input techniques enable highly diverse image generation while maintaining quality. Finally, we show promising results even under quantum shot noise conditions.

quant-ph↗

arXiv2026

A high-fidelity two-qubit gate for multimode superconducting P-mon qubits

To scale superconducting quantum processors, it is essential to achieve long coherence times while engineering interactions that do not introduce additional decoherence channels. In superconducting qubit systems, this can be realized using multimode circuits that feature a protected qubit mode alongside a distinct mediator mode. Building on this concept, our recently developed P-mon qubit provides intrinsic protection against decoherence from the readout environment. We extend this approach to controlled two-qubit interactions, by exploiting the mediator modes of P-mons for on-demand coupling. Because direct interactions between the qubit modes are strongly suppressed, unwanted $ZZ$-type interactions are significantly reduced to below $3.6(5)~\text{kHz}$ in the idle state. When tuning the coupled mediator modes on resonance, the cross-Kerr interaction between the qubit and the hybridized mediator modes leads to a qubit-state dependent frequency shift. By selectively addressing these transitions, we implement a $180~\text{ns}$ long CZ gate and determine a fidelity of $99.62(4)~\text{%}$. These results represent a significant step toward a scalable superconducting architecture that maintains high performance at scale.

quant-ph↗

arXiv2026

Quantum State Preparation via Neural Network Encoding in Quantum Machine Learning

A central challenge in quantum machine learning is the state preparation bottleneck that describes the prohibitive computational cost of loading high-dimensional classical data into a quantum state. Although amplitude encoding can represent $2^n$-dimensional data using only $n$ qubits in principle, preparing arbitrary states remains computationally expensive, typically requiring variational optimization of a parameterized quantum circuit for each individual data instance. In this work, we propose a method that avoids iterative optimization by training a classical neural network to map input data directly to the continuous parameters of a fixed quantum circuit. We demonstrate the generation of quantum image states with high fidelity on data not seen during training. Since all optimization is performed once during training, the resulting model encodes new inputs in a single inference step, providing a scalable pathway for data loading in near-term quantum algorithms. We validate our method on the MNIST and Fashion-MNIST datasets, achieving fidelities up to 0.992 on unseen images and reducing the per-data-instance runtime by more than 5000-fold.

quant-ph↗

arXiv2025

Typical Machine Learning Datasets as Low-Depth Quantum Circuits

Quantum machine learning (QML) is an emerging field that investigates the capabilities of quantum computers for learning tasks. While QML models can theoretically offer advantages such as exponential speed-ups, challenges in data loading and the ability to scale to relevant problem sizes have prevented demonstrations of such advantages on practical problems. In particular, the encoding of arbitrary classical data into quantum states usually comes at a high computational cost, either in terms of qubits or gate count. However, real-world data typically exhibits some inherent structure (such as image data) which can be leveraged to load them with a much smaller cost on a quantum computer. This work further develops an efficient algorithm for finding low-depth quantum circuits to load classical image data as quantum states. To evaluate its effectiveness, we conduct systematic studies on the MNIST, Fashion-MNIST, CIFAR-10, and Imagenette datasets. The corresponding circuits for loading the full large-scale datasets are available publicly as PennyLane datasets and can be used by the community for their own benchmarks. We further analyze the performance of various quantum classifiers, such as quantum kernel methods, parameterized quantum circuits, and tensor-network classifiers, and we compare them to convolutional neural networks. In particular, we focus on the performance of the quantum classifiers as we introduce nonlinear functions of the input state, e.g., by letting the circuit parameters depend on the input state.

quant-ph↗

arXiv2025

Path Matters: Industrial Data Meet Quantum Optimization

Real-world optimization problems must undergo a series of transformations before becoming solvable on current quantum hardware. Even for a fixed problem, the number of possible transformation paths -- from industry-relevant formulations through binary constrained linear programs (BILPs), to quadratic unconstrained binary optimization (QUBO), and finally to a hardware-executable representation -- is remarkably large. Each step introduces free parameters, such as Lagrange multipliers, encoding strategies, slack variables, rounding schemes or algorithmic choices -- making brute-force exploration of all paths intractable. In this work, we benchmark a representative subset of these transformation paths using a real-world industrial production planning problem with industry data: the optimization of work allocation in a press shop producing vehicle parts. We focus on QUBO reformulations and algorithmic parameters for both quantum annealing (QA) and the Linear Ramp Quantum Approximate Optimization Algorithm (LR-QAOA). Our goal is to identify a reduced set of effective configurations applicable to similar industrial settings. Our results show that QA on D-Wave hardware consistently produces near-optimal solutions, whereas LR-QAOA on IBM quantum devices struggles to reach comparable performance. Hence, the choice of hardware and solver strategy significantly impacts performance. The problem formulation and especially the penalization strategy determine the solution quality. Most importantly, mathematically-defined penalization strategies are equally successful as hand-picked penalty factors, paving the way for automated QUBO formulation. Moreover, we observe a strong correlation between simulated and quantum annealing performance metrics, offering a scalable proxy for predicting QA behavior on larger problem instances.

quant-ph↗

arXiv2025

Quantum Computing for Automotive Applications

Quantum computing could impact various industries, with the automotive industry with many computational challenges, from optimizing supply chains and manufacturing to vehicle engineering, being particularly promising. This chapter investigates state-of-the-art quantum algorithms to enhance efficiency, accuracy, and scalability across the automotive value chain. We explore recent advances in quantum optimization, machine learning, and numerical and chemistry simulations, highlighting their potential and limitations. We identify and discuss key challenges in near-term and fault-tolerant algorithms and their practical use in industrial applications. While quantum algorithms show potential in many application domains, current noisy intermediate-scale quantum hardware limits scale and, thus, business benefits. In the long term, fault-tolerant systems promise theoretical speedups; however, they also require further progress in hardware and software (e.g., related to error correction and data loading). We expect that with this progress, significant practical benefits will emerge eventually.

quant-ph↗

arXiv2025

Generative-enhanced optimization for knapsack problems: an industry-relevant study

Optimization is a crucial task in various industries such as logistics, aviation, manufacturing, chemical, pharmaceutical, and insurance, where finding the best solution to a problem can result in significant cost savings and increased efficiency. Tensor networks (TNs) have gained prominence in recent years in modeling classical systems with quantum-inspired approaches. More recently, TN generative-enhanced optimization (TN-GEO) has been proposed as a strategy which uses generative modeling to efficiently sample valid solutions with respect to certain constraints of optimization problems. Moreover, it has been shown that symmetric TNs (STNs) can encode certain constraints of optimization problems, thus aiding in their solution process. In this work, we investigate the applicability of TN- and STN-GEO to an industry relevant problem class, a multi-knapsack problem, in which each object must be assigned to an available knapsack. We detail a prescription for practitioners to use the TN-and STN-GEO methodology and study its scaling behavior and dependence on its hyper-parameters. We benchmark 60 different problem instances and find that TN-GEO and STN-GEO produce results of similar quality to simulated annealing.

cs.LG↗

arXiv2024

Efficient MPS representations and quantum circuits from the Fourier modes of classical image data

Machine learning tasks are an exciting application for quantum computers, as it has been proven that they can learn certain problems more efficiently than classical ones. Applying quantum machine learning algorithms to classical data can have many important applications, as qubits allow for dealing with exponentially more data than classical bits. However, preparing the corresponding quantum states usually requires an exponential number of gates and therefore may ruin any potential quantum speedups. Here, we show that classical data with a sufficiently quickly decaying Fourier spectrum after being mapped to a quantum state can be well-approximated by states with a small Schmidt rank (i.e., matrix-product states) and we derive explicit error bounds. These approximated states can, in turn, be prepared on a quantum computer with a linear number of nearest-neighbor two-qubit gates. We confirm our results numerically on a set of $1024\times1024$-pixel images taken from the `Imagenette' and DIV2K datasets. Additionally, we consider different variational circuit ansätze and demonstrate numerically that one-dimensional sequential circuits achieve the same compression quality as more powerful ansätze.

quant-ph↗

arXiv2024

Benchmarking Quantum Generative Learning: A Study on Scalability and Noise Resilience using QUARK

Quantum computing promises a disruptive impact on machine learning algorithms, taking advantage of the exponentially large Hilbert space available. However, it is not clear how to scale quantum machine learning (QML) to industrial-level applications. This paper investigates the scalability and noise resilience of quantum generative learning applications. We consider the training performance in the presence of statistical noise due to finite-shot noise statistics and quantum noise due to decoherence to analyze the scalability of QML methods. We employ rigorous benchmarking techniques to track progress and identify challenges in scaling QML algorithms, and show how characterization of QML systems can be accelerated, simplified, and made reproducible when the QUARK framework is used. We show that QGANs are not as affected by the curse of dimensionality as QCBMs and to which extent QCBMs are resilient to noise.

quant-ph↗

arXiv2024

A performance characterization of quantum generative models

Quantum generative modeling is a growing area of interest for industry-relevant applications. With the field still in its infancy, there are many competing techniques. This work is an attempt to systematically compare a broad range of these techniques to guide quantum computing practitioners when deciding which models and techniques to use in their applications. We compare fundamentally different architectural ansatzes of parametric quantum circuits used for quantum generative modeling: 1. A continuous architecture, which produces continuous-valued data samples, and 2. a discrete architecture, which samples on a discrete grid. We compare the performance of different data transformations: normalization by the min-max transform or by the probability integral transform. We learn the underlying probability distribution of the data sets via two popular training methods: 1. quantum circuit Born machines (QCBM), and 2. quantum generative adversarial networks (QGAN). We study their performance and trade-offs as the number of model parameters increases, with the baseline of similarly trained classical neural networks. The study is performed on six low-dimensional synthetic and two real financial data sets. Our two key findings are that: 1. For all data sets, our quantum models require similar or fewer parameters than their classical counterparts. In the extreme case, the quantum models require two of orders of magnitude less parameters. 2. We empirically find that a variant of the discrete architecture, which learns the copula of the probability distribution, outperforms all other methods.

quant-ph↗

arXiv2023

Efficient decoupling of a non-linear qubit mode from its environment

To control and measure the state of a quantum system it must necessarily be coupled to external degrees of freedom. This inevitably leads to spontaneous emission via the Purcell effect, photon-induced dephasing from measurement back-action, and errors caused by unwanted interactions with nearby quantum systems. To tackle this fundamental challenge, we make use of the design flexibility of superconducting quantum circuits to form a multi-mode element -- an artificial molecule -- with symmetry-protected modes. The proposed circuit consists of three superconducting islands coupled to a central island via Josephson junctions. It exhibits two essential non-linear modes, one of which is flux-insensitive and used as the protected qubit mode. The second mode is flux-tunable and serves via a cross-Kerr type coupling as a mediator to control the dispersive coupling of the qubit mode to the readout resonator. We demonstrate the Purcell protection of the qubit mode by measuring relaxation times that are independent of the mediated dispersive coupling. We show that the coherence of the qubit is not limited by photon-induced dephasing when detuning the mediator mode from the readout resonator and thereby reducing the dispersive coupling. The resulting highly protected qubit with tunable interactions may serve as a basic building block of a scalable quantum processor architecture, in which qubit decoherence is strongly suppressed.

quant-ph↗

arXiv2023

Application-Oriented Benchmarking of Quantum Generative Learning Using QUARK

Benchmarking of quantum machine learning (QML) algorithms is challenging due to the complexity and variability of QML systems, e.g., regarding model ansatzes, data sets, training techniques, and hyper-parameters selection. The QUantum computing Application benchmaRK (QUARK) framework simplifies and standardizes benchmarking studies for quantum computing applications. Here, we propose several extensions of QUARK to include the ability to evaluate the training and deployment of quantum generative models. We describe the updated software architecture and illustrate its flexibility through several example applications: (1) We trained different quantum generative models using several circuit ansatzes, data sets, and data transformations. (2) We evaluated our models on GPU and real quantum hardware. (3) We assessed the generalization capabilities of our generative models using a broad set of metrics that capture, e.g., the novelty and validity of the generated data.

quant-ph↗

arXiv2022

A practical overview of image classification with variational tensor-network quantum circuits

Circuit design for quantum machine learning remains a formidable challenge. Inspired by the applications of tensor networks across different fields and their novel presence in the classical machine learning context, one proposed method to design variational circuits is to base the circuit architecture on tensor networks. Here, we comprehensively describe tensor-network quantum circuits and how to implement them in simulations. This includes leveraging circuit cutting, a technique used to evaluate circuits with more qubits than those available on current quantum devices. We then illustrate the computational requirements and possible applications by simulating various tensor-network quantum circuits with PennyLane, an open-source python library for differential programming of quantum computers. Finally, we demonstrate how to apply these circuits to increasingly complex image processing tasks, completing this overview of a flexible method to design circuits that can be applied to industrially-relevant machine learning tasks.

quant-ph↗

arXiv2015

Characterizing and Quantifying Quantum Chaos with Quantum Tomography

We explore quantum signatures of classical chaos by studying the rate of information gain in quantum tomography. The tomographic record consists of a time series of expectation values of a Hermitian operator evolving under application of the Floquet operator of a quantum map that possesses (or lacks) time reversal symmetry. We find that the rate of information gain, and hence the fidelity of quantum state reconstruction, depends on the symmetry class of the quantum map involved. Moreover, we find an increase in information gain and hence higher reconstruction fidelities when the Floquet maps employed increase in chaoticity. We make predictions for the information gain and show that these results are well described by random matrix theory in the fully chaotic regime. We derive analytical expressions for bounds on information gain using random matrix theory for different class of maps and show that these bounds are realized by fully chaotic quantum systems.

quant-ph↗

arXiv2014

Single Shot Quantum State Estimation via a Continuous Measurement in the Strong Backaction Regime

We study quantum tomography based on a stochastic continuous-time measurement record obtained from a probe field collectively interacting with an ensemble of identically prepared systems. In comparison to previous studies, we consider here the case in which the measurement-induced backaction has a nonnegligible effect on the dynamical evolution of the ensemble. We formulate a maximum likelihood estimate for the initial quantum state given only a single instance of the continuous diffusive measurement record. We apply our estimator to the simplest problem -- state tomography of a single pure qubit, which, during the course of the measurement, is also subjected to dynamical control. We identify a regime where the many-body system is well approximated at all times by a separable pure spin coherent state, whose Bloch vector undergoes a conditional stochastic evolution. We simulate the results of our estimator and show that we can achieve close to the upper bound of fidelity set by the optimal POVM. This estimate is compared to, and significantly outperforms, an equivalent estimator that ignores measurement backaction.

quant-ph↗

arXiv2013

Information gain in tomography - A quantum signature of chaos

We find quantum signatures of classical chaos in various metrics of information gain in quantum tomography. We employ a quantum state estimator based on weak collective measurements of an ensemble of identically prepared systems. The tomographic measurement record consists of a sequence of expectation values of a Hermitian operator that evolves under repeated application of the Floquet map of the quantum kicked top. We find an increase in information gain and hence higher fidelities in the reconstruction algorithm when the chaoticity parameter map increases. The results are well predicted by random matrix theory.

quant-ph↗

arXiv2011

Continuous Measurement Quantum State Tomography of Atomic Ensembles

Quantum state tomography is a fundamental tool in quantum information processing. It allows us to estimate the state of a quantum system by measuring different observables on many identically prepared copies of the system. This is, in general, a very time-consuming task that requires a large number of measurements. There are, however, systems in which the data acquisition can be done more efficiently. In fact, an ensemble of quantum systems can be prepared and manipulated by external fields while being continuously and collectively probed, producing enough information to estimate its state. This provides a basis for continuous measurement quantum tomography. In this protocol, an ensemble of identically prepared systems is collectively probed and controlled in a time-dependent manner to create an informationally complete continuous measurement record. The measurement history is then inverted to determine the state at the initial time. We use two different estimation methods: maximum likelihood and compressed sensing. The general formalism is applied to the case of reconstruction of the quantum state encoded in the magnetic sub-levels of a large-spin alkali atom, ${}^{133}$Cs. We apply this protocol to the case of reconstruction of states in the full 16-dimensional electronic-ground subspace ($F=3 \oplus F=4$), controlled by microwaves and radio-frequency magnetic fields. We present an experimental demonstration of continuous measurement quantum tomography in an ensemble of cold cesium atoms with full control of its 16-dimensional Hilbert space. We show the exquisite level of control achieved in the lab and the excellent agreement between the theory discussed in this dissertation and the experimental results. This allows us to achieve fidelities >95% for low complexity quantum states, and >92% for arbitrary random states, which is a formidable accomplishment for a space of this size.

quant-ph↗