SearcharxivSearch

arXiv subjects

Arianna Crippa

Publications and source records attributed to Arianna Crippa.

17 recordsLinked to original sources

Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data

Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied to non-binary datasets, they exhibit notable limitations: mapping integer values into qubit-compatible binary representations often destroys the original metric structure of the data. In this paper we aim to extend them to a qudits formulation operating on an integer mapping of the data. The IQP quantum circuit is adapted to encode each integer valued pixel into a bit-string of fixed length and quantum gates are transformed to follow the qudit formalism. As a generative machine learning approach, a suitable loss function for the circuit training and the calculation of the covariance matrix among features are developed and validated on the energy deposits from single-particle electron showers in the electromagnetic calorimeter of the CLIC detector. The method proposed in this work can be also extended to other applications that utilize quantum generative machine learning for non-binary data.

quant-ph

(2+1)D quantum electrodynamics at finite density on a quantum computer

In this paper, we explore (2+1)D quantum electrodynamics (QED) at finite density on a quantum computer, including two fermion flavors. Our method employs an efficient gauge-invariant ansatz together with a quantum circuit structure that enforces Gauss's law. As a proof of principle, we benchmark our simulation protocol on a small lattice system, demonstrating the identification of phase transitions in terms of the particle number of the fermion flavors. Classical simulations are used to obtain optimized variational parameters, which are then deployed in inference runs on IBM quantum hardware. We conclude by discussing hardware limitations and prospects for scaling this method to larger systems.

hep-lat

Quantum Brush: A quantum computing-based tool for digital painting

We present Quantum Brush, an open-source digital painting tool that harnesses quantum computing to generate novel artistic expressions. The tool includes four different brushes that translate strokes into unique quantum algorithms, each highlighting a different way in which quantum effects can produce novel aesthetics. Each brush is designed to be compatible with the current noisy intermediate-scale quantum (NISQ) devices, as demonstrated by executing them on IQM's Sirius device.

cs.GR

Analysis of the confinement string in (2 + 1)-dimensional Quantum Electrodynamics with a trapped-ion quantum computer

Compact lattice Quantum Electrodynamics is a complex quantum field theory with dynamical gauge and matter fields and it has similarities with Quantum Chromodynamics, in particular asymptotic freedom and confinement. We consider a (2+1)-dimensional lattice discretization of Quantum Electrodynamics with the inclusion of dynamical fermionic matter. We define a suitable quantum algorithm to measure the static potential as a function of the distance between two charges on the lattice and we use a variational quantum calculation to explore the Coulomb, confinement and string breaking regimes. A symmetry-preserving and resource-efficient variational quantum circuit is employed to prepare the ground state of the theory at various values of the coupling constant, corresponding to different physical distances, allowing the accurate extraction of the static potential from a quantum computer. We demonstrate that results from quantum experiments on the Quantinuum H1-1 trapped-ion device and emulator, with full connectivity between qubits, agree with classical noiseless simulations using circuits with 10 and 24 qubits. Moreover, we visualize the electric field flux configurations that mostly contribute in the wave-function of the quantum ground state in the different regimes of the potential, thus giving insights into the mechanisms of confinement and string breaking. These results are a promising step forward in the grand challenge of solving higher dimensional lattice gauge theory problems with quantum computing algorithms.

hep-lat

Quantum computing inspired paintings: reinterpreting classical masterpieces

We aim to apply a quantum computing technique to compose artworks. The main idea is to revisit three paintings of different styles and historical periods: ''Narciso'', painted circa 1597-1599 by Michelangelo Merisi (Caravaggio), ''Les fils de l'homme'', painted in 1964 by Rene Magritte and ''192 Farben'', painted in 1966 by Gerard Richter. We utilize the output of a quantum computation to change the composition in the paintings, leading to a paintings series titled ''Quantum Transformation I, II, III''. In particular, the figures are discretized into square lattices and the order of the pieces is changed according to the result of the quantum simulation. We consider an Ising Hamiltonian as the observable in the quantum computation and its time evolution as the final outcome. From a classical subject to abstract forms, we seek to combine classical and quantum aesthetics through these three art pieces. Besides experimenting with hardware runs and circuit noise, our goal is to reproduce these works as physical oil paintings on wooden panels. With this process, we complete a full circle between classical and quantum techniques and contribute to rethinking Art practice in the era of quantum computing technologies.

quant-ph

Developing a Framework for Sonifying Variational Quantum Algorithms: Implications for Music Composition

This chapter examines the Variational Quantum Harmonizer, a software tool and musical interface that focuses on the problem of sonification of the minimization steps of Variational Quantum Algorithms (VQA), used for simulating properties of quantum systems and optimization problems assisted by quantum hardware. Particularly, it details the sonification of Quadratic Unconstrained Binary Optimization (QUBO) problems using VQA. A flexible design enables its future applications both as a sonification tool for auditory displays in scientific investigation, and as a hybrid quantum-digital musical instrument for artistic endeavours. In turn, sonification can help researchers understand complex systems better and can serve for the training of quantum physics and quantum computing. The VQH structure, including its software implementation, control mechanisms, and sonification mappings are detailed. Moreover, it guides the design of QUBO cost functions in VQH as a music compositional object. The discussion is extended to the implications of applying quantum-assisted simulation in quantum-computer aided composition and live-coding performances. An artistic output is showcased by the piece \textit{Hexagonal Chambers} (Thomas and Itaboraí, 2023).

cs.SD

Towards determining the (2+1)-dimensional Quantum Electrodynamics running coupling with Monte Carlo and quantum computing methods

In this paper, we examine a compact $U(1)$ lattice gauge theory in $(2+1)$ dimensions and present a strategy for studying the running coupling and extracting the non-perturbative $Λ$-parameter. To this end, we combine Monte Carlo simulations and quantum computing, where the former can be used to determine the numerical value of the lattice spacing $a$, and the latter allows for reaching the perturbative regime at very small values of the bare coupling and, correspondingly, small values of $a$. The methodology involves a series of sequential steps (i.e., the step scaling function) to bridge results from small lattice spacings to non-perturbative large-scale lattice calculations. Focusing on the pure gauge case, we demonstrate that these quantum circuits, adapted to gauge degrees of freedom, are able to capture the relevant physics by studying the expectation value of the plaquette operator, for matching with corresponding Monte Carlo simulations. We also present results for the static potential and static force, which can be related to the renormalized coupling. The procedure outlined in this work can be extended to Abelian and non-Abelian lattice gauge theories with matter fields and might provide a way towards studying lattice quantum chromodynamics utilizing both quantum and classical methods.

hep-lat

First-Order Phase Transition of the Schwinger Model with a Quantum Computer

We explore the first-order phase transition in the lattice Schwinger model in the presence of a topological $θ$-term by means of the variational quantum eigensolver (VQE). Using two different fermion discretizations, Wilson and staggered fermions, we develop parametric ansatz circuits suitable for both discretizations, and compare their performance by simulating classically an ideal VQE optimization in the absence of noise. The states obtained by the classical simulation are then prepared on the IBM's superconducting quantum hardware. Applying state-of-the art error-mitigation methods, we show that the electric field density and particle number, observables which reveal the phase structure of the model, can be reliably obtained from the quantum hardware. To investigate the minimum system sizes required for a continuum extrapolation, we study the continuum limit using matrix product states, and compare our results to continuum mass perturbation theory. We demonstrate that taking the additive mass renormalization into account is vital for enhancing the precision that can be obtained with smaller system sizes. Furthermore, for the observables we investigate we observe universality, and both fermion discretizations produce the same continuum limit.

hep-lat

Fermionic wave packet scattering: a quantum computing approach

Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However, preparing and evolving particle wave packets on a quantum device is a nontrivial task. In this work, we propose a method to prepare Gaussian wave packets with momentum on top of the interacting ground state of a fermionic Hamiltonian. Using Givens rotation, we show how to efficiently obtain expectation values of observables throughout the evolution of the wave packets on digital quantum computers. We demonstrate our technique by applying it to the staggered lattice formulation of the Thirring model and studying the scattering of two wave packets. Monitoring the particle density and the entropy produced during the scattering process, we characterize the phenomenon and provide a first step towards studying more complicated collision processes on digital quantum computers. In addition, we perform a small-scale demonstration on IBM's quantum hardware, showing that our method is suitable for current and near-term quantum devices.

quant-ph

Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs

We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams in the Loop-Tree Duality (LTD) or, equivalently, the selection of acyclic configurations in directed graphs. A loop Hamiltonian based on the adjacency matrix describing a multiloop topology, and whose different energy levels correspond to the number of cycles, is minimized by VQE to identify the causal or acyclic configurations. The algorithm has been adapted to select multiple degenerated minima and thus achieves higher detection rates. A performance comparison with a Grover's based algorithm is discussed in detail. The VQE approach requires, in general, fewer qubits and shorter circuits for its implementation, albeit with lesser success rates.

hep-ph

Variational Quantum Harmonizer: Generating Chord Progressions and Other Sonification Methods with the VQE Algorithm

This work investigates a case study of using physical-based sonification of Quadratic Unconstrained Binary Optimization (QUBO) problems, optimized by the Variational Quantum Eigensolver (VQE) algorithm. The VQE approximates the solution of the problem by using an iterative loop between the quantum computer and a classical optimization routine. This work explores the intermediary statevectors found in each VQE iteration as the means of sonifying the optimization process itself. The implementation was realised in the form of a musical interface prototype named Variational Quantum Harmonizer (VQH), providing potential design strategies for musical applications, focusing on chords, chord progressions, and arpeggios. The VQH can be used both to enhance data visualization or to create artistic pieces. The methodology is also relevant in terms of how an artist would gain intuition towards achieving a desired musical sound by carefully designing QUBO cost functions. Flexible mapping strategies could supply a broad portfolio of sounds for QUBO and quantum-inspired musical compositions, as demonstrated in a case study composition, "Dependent Origination" by Peter Thomas and Paulo Itaborai.

cs.ET

Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group

Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage, namely a significant (in some cases exponential) speed-up of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models which are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this roadmap paper, led by CERN, DESY and IBM, we provide the status of high-energy physics quantum computations and give examples for theoretical and experimental target benchmark applications, which can be addressed in the near future. Having the IBM 100 x 100 challenge in mind, where possible, we also provide resource estimates for the examples given using error mitigated quantum computing.

quant-ph

Quantum algorithms for charged particle track reconstruction in the LUXE experiment

The LUXE experiment is a new experiment in planning in Hamburg, which will study Quantum Electrodynamics at the strong-field frontier. LUXE intends to measure the positron production rate in this unprecedented regime by using, among others, a silicon tracking detector. The large number of expected positrons traversing the sensitive detector layers results in an extremely challenging combinatorial problem, which can become computationally expensive for classical computers. This paper investigates the potential future use of gate-based quantum computers for pattern recognition in track reconstruction. Approaches based on a quadratic unconstrained binary optimisation and a quantum graph neural network are investigated in classical simulations of quantum devices and compared with a classical track reconstruction algorithm. In addition, a proof-of-principle study is performed using quantum hardware.

quant-ph

Track reconstruction at the LUXE experiment using quantum algorithms

LUXE (Laser Und XFEL Experiment) is a proposed experiment at DESY which will study Quantum Electrodynamics (QED) in the strong-field regime, where QED becomes non-perturbative. Measuring the rate of created electron-positron pairs using a silicon pixel tracking detector is an essential ingredient to study this regime. Precision tracking of positrons traversing the four layers of the tracking detector becomes very challenging at high laser intensities due to the high rates, which can be computationally expensive for classical computers. In this work, we update our previous study of the potential of using quantum computing to reconstruct positron tracks. The reconstruction task is formulated as a quadratic unconstrained binary optimisation and is solved using simulated quantum computers and a hybrid quantum-classical algorithm, namely the variational quantum eigensolver. Different ansatz circuits and optimisers are studied. The results are discussed and compared with classical track reconstruction algorithms using a graph neural network and a combinatorial Kalman filter.

hep-ex

Strategies for the Determination of the Running Coupling of $(2+1)$-dimensional QED with Quantum Computing

We propose to utilize NISQ-era quantum devices to compute short distance quantities in $(2+1)$-dimensional QED and to combine them with large volume Monte Carlo simulations and perturbation theory. On the quantum computing side, we perform a calculation of the mass gap in the small and intermediate regime, demonstrating, in the latter case, that it can be resolved reliably. The so obtained mass gap can be used to match corresponding results from Monte Carlo simulations, which can be used eventually to set the physical scale. In this paper we provide the setup for the quantum computation and show results for the mass gap and the plaquette expectation value. In addition, we discuss some ideas that can be applied to the computation of the running coupling. Since the theory is asymptotically free, it would serve as a training ground for future studies of QCD in $(3+1)$-dimensions on quantum computers.

hep-lat

Classical Splitting of Parametrized Quantum Circuits

Barren plateaus appear to be a major obstacle to using variational quantum algorithms to simulate large-scale quantum systems or replace traditional machine learning algorithms. They can be caused by multiple factors such as expressivity, entanglement, locality of observables, or even hardware noise. We propose classical splitting of ansätze or parametrized quantum circuits to avoid barren plateaus. Classical splitting is realized by splitting an $N$ qubit ansatz to multiple ansätze that consists of $\mathcal{O}(\log N)$ qubits. We show that such an ansatz can be used to avoid barren plateaus. We support our results with numerical experiments and perform binary classification on classical and quantum datasets. Then, we propose an extension of the ansatz that is compatible with variational quantum simulations. Finally, we discuss a speed-up for gradient-based optimization and hardware implementation, robustness against noise and parallelization, making classical splitting an ideal tool for noisy intermediate scale quantum (NISQ) applications.

quant-ph

New Directions in Quantum Music: concepts for a quantum keyboard and the sound of the Ising model

We explore ideas for generating sounds and eventually music by using quantum devices in the NISQ era using quantum circuits. In particular, we first consider a concept for a "qeyboard", i.e. a quantum keyboard, where the real-time behaviour of expectation values using a time evolving quantum circuit can be associated to sound features like intensity, frequency and tone. Then, we examine how these properties can be extracted from physical quantum systems, taking the Ising model as an example. This can be realized by measuring physical quantities of the quantum states of the system, e.g. the energies and the magnetization obtained via variational quantum simulation techniques.

quant-ph