arXiv subjects

Stefan Kühn

Publications and source records attributed to Stefan Kühn.

At least 55 records · Page 3Linked to original sources

arXiv2023

Particle track reconstruction with noisy intermediate-scale quantum computers

The reconstruction of trajectories of charged particles is a key computational challenge for current and future collider experiments. Considering the rapid progress in quantum computing, it is crucial to explore its potential for this and other problems in high-energy physics. The problem can be formulated as a quadratic unconstrained binary optimization (QUBO) and solved using the variational quantum eigensolver (VQE) algorithm. In this work the effects of dividing the QUBO into smaller sub-QUBOs that fit on the hardware available currently or in the near term are assessed. Then, the performance of the VQE on small sub-QUBOs is studied in an ideal simulation, using a noise model mimicking a quantum device and on IBM quantum computers. This work serves as a proof of principle that the VQE could be used for particle tracking and investigates modifications of the VQE to make it more suitable for combinatorial optimization.

quant-ph↗

arXiv2023

Quantum spin helices more stable than the ground state: onset of helical protection

Topological magnetic structures are promising candidates for resilient information storage. An elementary example are spin helices in one-dimensional easy-plane quantum magnets. To quantify their stability, we numerically implement the stochastic Schrödinger equation and time-dependent perturbation theory for spin chains with fluctuating local magnetic fields. We find two classes of quantum spin helices that can reach and even exceed ground-state stability: Spin-current-maximizing helices and, for fine-tuned boundary conditions, the recently discovered "phantom helices". Beyond that, we show that the helicity itself (left- or right-rotating) is even more stable. We explain these findings by separated helical sectors and connect them to topological sectors in continuous spin systems. The resulting helical protection mechanism is a promising phenomenon towards stabilizing helical quantum structures, e.g., in ultracold atoms and solid state systems. We also identify an - up to our knowledge - previously unknown new type of phantom helices.

cond-mat.str-el↗

arXiv2022

Exploring the phase structure of the multi-flavor Schwinger model with quantum computing

We propose a variational quantum eigensolver suitable for exploring the phase structure of the multi-flavor Schwinger model in the presence of a chemical potential. The parametric ansatz circuit we design is capable of incorporating the symmetries of the model, present in certain parameter regimes, which allows for reducing the number of variational parameters substantially. Moreover, the ansatz circuit can be implementated on both measurement-based and circuit-based quantum hardware. We numerically demonstrate that our ansatz circuit is able to capture the phase structure of the model and allows for faithfully approximating the ground state. Our results show that our approach is suitable for current intermediate-scale quantum hardware and can be readily implemented on existing quantum devices.

quant-ph↗

arXiv2022

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↗

arXiv2022

Measurement Error Mitigation in Quantum Computers Through Classical Bit-Flip Correction

We develop a classical bit-flip correction method to mitigate measurement errors on quantum computers. This method can be applied to any operator, any number of qubits, and any realistic bit-flip probability. We first demonstrate the successful performance of this method by correcting the noisy measurements of the ground-state energy of the longitudinal Ising model. We then generalize our results to arbitrary operators and test our method both numerically and experimentally on IBM quantum hardware. As a result, our correction method reduces the measurement error on the quantum hardware by up to one order of magnitude. We finally discuss how to pre-process the method and extend it to other errors sources beyond measurement errors. For local Hamiltonians, the overhead costs are polynomial in the number of qubits, even if multi-qubit correlations are included.

quant-ph↗

arXiv2022

Phase structure of the CP(1) model in the presence of a topological $θ$-term

We numerically study the phase structure of the CP(1) model in the presence of a topological $θ$-term, a regime afflicted by the sign problem for conventional lattice Monte Carlo simulations. Using a bond-weighted tensor renormalization group method, we compute the free energy for inverse couplings ranging from $0\leq β\leq 1.1$ and find a CP-violating, first-order phase transition at $θ=π$. In contrast to previous findings, our numerical results provide no evidence for a critical coupling $β_c<1.1$ above which a second-order phase transition emerges at $θ=π$ and/or the first-order transition line bifurcates at $θ\neqπ$. If such a critical coupling exists, as suggested by Haldane's conjecture, our study indicates that is larger than $β_c>1.1$.

hep-lat↗

arXiv2022

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↗

arXiv2022

Impact of quantum noise on the training of quantum Generative Adversarial Networks

Current noisy intermediate-scale quantum devices suffer from various sources of intrinsic quantum noise. Overcoming the effects of noise is a major challenge, for which different error mitigation and error correction techniques have been proposed. In this paper, we conduct a first study of the performance of quantum Generative Adversarial Networks (qGANs) in the presence of different types of quantum noise, focusing on a simplified use case in high-energy physics. In particular, we explore the effects of readout and two-qubit gate errors on the qGAN training process. Simulating a noisy quantum device classically with IBM's Qiskit framework, we examine the threshold of error rates up to which a reliable training is possible. In addition, we investigate the importance of various hyperparameters for the training process in the presence of different error rates, and we explore the impact of readout error mitigation on the results.

quant-ph↗

arXiv2022

Studying quantum algorithms for particle track reconstruction in the LUXE experiment

The LUXE experiment (LASER Und XFEL Experiment) is a new experiment in planning at DESY Hamburg, which will study Quantum Electrodynamics (QED) at the strong-field frontier. In this regime, QED is non-perturbative. This manifests itself in the creation of physical electron-positron pairs from the QED vacuum. 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 very hard for classical computers. This paper presents a preliminary study to explore the potential of quantum computers to solve this problem and to reconstruct the positron trajectories from the detector energy deposits. The reconstruction problem is formulated in terms of a quadratic unconstrained binary optimisation. Finally, the results from the quantum simulations are discussed and compared with traditional classical track reconstruction algorithms.

hep-ex↗

arXiv2021

Dimensional Expressivity Analysis, best-approximation errors, and automated design of parametric quantum circuits

The design of parametric quantum circuits (PQCs) for efficient use in variational quantum simulations (VQS) is subject to two competing factors. On one hand, the set of states that can be generated by the PQC has to be large enough to contain the solution state. Otherwise, one may at best find the best approximation of the solution restricted to the states generated by the chosen PQC. On the other hand, the PQC should contain as few parametric quantum gates as possible to minimize noise from the quantum device. Thus, when designing a PQC one needs to ensure that there are no redundant parameters. The dimensional expressivity analysis discussed in these proceedings is a means of addressing these counteracting effects. Its main objective is to identify independent and redundant parameters in the PQC. Using this information, superfluous parameters can be removed and the dimension of the space of states that are generated by the PQC can be computed. Knowing the dimension of the physical state space then allows us to deduce whether or not the PQC can reach all physical states. Furthermore, the dimensional expressivity analysis can be implemented efficiently using a hybrid quantum-classical algorithm. This implementation has relatively small overhead costs both for the classical and quantum part of the algorithm and could therefore be used in the future for on-the-fly circuit construction. This would allow for optimized circuits to be used in every loop of a VQS rather than the same PQC for the entire VQS. These proceedings review and extend work in [1, 2].

quant-ph↗

arXiv2021

CP-violating Dashen phase transition in the two-flavor Schwinger model: a study with matrix product states

We numerically study the Hamiltonian lattice formulation of the two-flavor Schwinger model using matrix product states. Keeping the mass of the first flavor at a fixed positive value, we tune the mass of the second flavor through a range of negative values, thus exploring a regime where conventional Monte Carlo methods suffer from the sign problem and may run into instabilities due to zero modes. Our results indicate a phase transition at the point where the absolute value of the second flavor mass approaches the first flavor mass. The phase transition is accompanied by the formation of a fermion condensate, a steep drop of the average electric field, and a peak in the bipartite entanglement entropy. Our data hints at a second order transition, which is the 1+1D analog of the CP-violating Dashen phase transition in QCD.

hep-lat↗

arXiv2021

3+1D $θ$-Term on the Lattice from the Hamiltonian Perspective

Quantum and tensor network simulations have emerged as prominent sign-problem free approaches to lattice gauge theories. Unlike conventional Markov chain Monte Carlo methods, they are based on the Hamiltonian formulation. In this talk, we fill a gap in the literature and present the first derivation of the Hamiltonian 3+1D $θ$-term -- which is an important sign-problem afflicted term -- for Abelian and non-Abelian lattice gauge theories. Furthermore, we perform exact diagonalization for a 3+1D U(1) lattice gauge theory including the $θ$-term on a unit periodic cube. Our numerical results reveal a novel phase transition at fixed values of $θ$ in the strong-coupling regime. The transition is evidenced by an avoided level crossing in the ground state energy, as well as sudden changes in the plaquette expectation value, the electric energy density, and the topological charge density. Extensions of our work to larger lattices can be readily performed using state-of-the-art tensor network simulations. Moreover, our work provides a concrete starting point for an eventual quantum simulation of the $θ$-dependent phase structure and dynamics of lattice gauge theories in 3+1D. This talk is mainly based on [1]. We expand beyond [1] by including a derivation of the (non-)Abelian fixed-length Higgs term in the Hamiltonian formulation for future studies of (non-)Abelian-Higgs models with a $θ$-term.

hep-lat↗

arXiv2021

Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise

Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. As a novel approach, quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations and may eventually outperform classical computers. However, current quantum devices still suffer from inherent quantum noise. In this work, we propose an error mitigation scheme suitable for parametric quantum circuits. This scheme is based on projecting a general quantum noise channel onto depolarization errors. Our method can efficiently reduce errors in quantum computations, which we demonstrate by carrying out simulations both on classical and IBM's quantum devices. In particular, we test the performance of the method by computing the mass gap of the transverse-field Ising model using the variational quantum eigensolver algorithm.

quant-ph↗

arXiv2021

Investigating the variance increase of readout error mitigation through classical bit-flip correction on IBM and Rigetti quantum computers

Readout errors are among the most dominant errors on current noisy intermediate-scale quantum devices. Recently, an efficient and scaleable method for mitigating such errors has been developed, based on classical bit-flip correction. In this talk, we compare the performance of this method for IBM's and Rigetti's quantum devices, demonstrating how the method improves the noisy measurements of observables obtained on the quantum hardware. Moreover, we examine the variance amplification to the data after applying of our mitigation procedure, which is common to all mitigation strategies. We derive a new expression for the variance of the mitigated Pauli operators in terms of the corrected expectation values and the noisy variances.Our hardware results show good agreement with the theoretical prediction, and we demonstrate that the increase of the variance due to the mitigation procedure is only moderate.

quant-ph↗

arXiv2021

Investigating a (3+1)D Topological $θ$-Term in the Hamiltonian Formulation of Lattice Gauge Theories for Quantum and Classical Simulations

Quantum technologies offer the prospect to efficiently simulate sign-problem afflicted regimes in lattice field theory, such as the presence of topological terms, chemical potentials, and out-of-equilibrium dynamics. In this work, we derive the (3+1)D topological $θ$-term for Abelian and non-Abelian lattice gauge theories in the Hamiltonian formulation, paving the way towards Hamiltonian-based simulations of such terms on quantum and classical computers. We further study numerically the zero-temperature phase structure of a (3+1)D U(1) lattice gauge theory with the $θ$-term via exact diagonalization for a single periodic cube. In the strong coupling regime, our results suggest the occurrence of a phase transition at constant values of $θ$, as indicated by an avoided level-crossing and abrupt changes in the plaquette expectation value, the electric energy density, and the topological charge density. These results could in principle be cross-checked by the recently developed (3+1)D tensor network methods and quantum simulations, once sufficient resources become available.

hep-lat↗

arXiv2021

Towards Quantum Simulations in Particle Physics and Beyond on Noisy Intermediate-Scale Quantum Devices

We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high energy physics and beyond on noisy intermediate-scale quantum (NISQ) devices. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices. Both methods can lead to significant improvements in quantum simulations, e.g., when variational quantum eigensolvers are used.

quant-ph↗

arXiv2021

Best-approximation error for parametric quantum circuits

In Variational Quantum Simulations, the construction of a suitable parametric quantum circuit is subject to two counteracting effects. The number of parameters should be small for the device noise to be manageable, but also large enough for the circuit to be able to represent the solution. Dimensional expressivity analysis can optimize a candidate circuit considering both aspects. In this article, we will first discuss an inductive construction for such candidate circuits. Furthermore, it is sometimes necessary to choose a circuit with fewer parameters than necessary to represent all relevant states. To characterize such circuits, we estimate the best-approximation error using Voronoi diagrams. Moreover, we discuss a hybrid quantum-classical algorithm to estimate the worst-case best-approximation error, its complexity, and its scaling in state space dimensionality. This allows us to identify some obstacles for variational quantum simulations with local optimizers and underparametrized circuits, and we discuss possible remedies.

quant-ph↗

arXiv2021

Dimensional Expressivity Analysis of Parametric Quantum Circuits

Parametric quantum circuits play a crucial role in the performance of many variational quantum algorithms. To successfully implement such algorithms, one must design efficient quantum circuits that sufficiently approximate the solution space while maintaining a low parameter count and circuit depth. In this paper, we develop a method to analyze the dimensional expressivity of parametric quantum circuits. Our technique allows for identifying superfluous parameters in the circuit layout and for obtaining a maximally expressive ansatz with a minimum number of parameters. Using a hybrid quantum-classical approach, we show how to efficiently implement the expressivity analysis using quantum hardware, and we provide a proof of principle demonstration of this procedure on IBM's quantum hardware. We also discuss the effect of symmetries and demonstrate how to incorporate or remove symmetries from the parametrized ansatz.

quant-ph↗