Searcharxiv⌕ Search

arXiv subjects

Frank K. Wilhelm

Publications and source records attributed to Frank K. Wilhelm.

At least 37 records · Page 2Linked to original sources
arXiv2025

Bounding the rotating wave approximation for coupled harmonic oscillators

In this work we study the validity of the rotating wave approximation of an ideal system composed of two harmonic oscillators evolving with a quadratic Hamiltonian and arbitrarily strong interaction. We prove its validity for arbitrary states by bounding the error introduced. We then restrict ourselves to the dynamics of Gaussian states and are able to fully quantify the deviation of arbitrary pure Gaussian states that evolve through different dynamics from a common quantum state. We show that this distance is fully determined by the first and second moments of the statistical distribution of the number of excitations created from the vacuum during an appropriate effective time-evolution. We use these results to completely control the dynamics for this class of states, therefore providing a toolbox to be used in quantum optics and quantum information. Applications and potential physical implementations are also discussed.

quant-ph↗
arXiv2025

Quantum Algorithm for Green's Functions Measurements in the Fermi-Hubbard Model

In the framework of the hybrid quantum-classical variational cluster approach (VCA) to strongly correlated electron systems one of the goals of a quantum subroutine is to find single-particle correlation functions of lattice fermions in polynomial time. Previous works suggested to use variants of the Hadamard test for this purpose, which requires an implementation of controlled single-particle fermionic operators. However, for a number of locality-preserving mappings to encode fermions into qubits, a direct construction of such operators is not possible. In this work, we propose a new quantum algorithm, which uses an analog of the Kubo formula adapted to a quantum circuit simulating the Hubbard model. It allows to access the Green's function of a cluster directly using only bilinears of fermionic operators and circumvents the usage of the Hadamard test. We test our new algorithm in practice by using open-access simulators of noisy IBM superconducting chips.

quant-ph↗
arXiv2025

Demolition measurement protocol for transmon qubits

The process of measuring a qubit and re-initializing it to the ground state practically lead to long qubit idle times between re-runs of experiments on a superconducting quantum computer. Here, we propose a protocol for a \textit{demolition measurement} of a transmon qubit that integrates qubit readout with the reset process to minimize qubit idle time. We present a three-staged implementation of this protocol, involving a combined qubit readout and resonator reset scheme that unconditionally resets the resonator at the end of the readout; a leakage removal scheme that can be integrated with the measurement stage; and an unconditional qubit reset. We demonstrate that this protocol could be implemented in $1 \, μ$s with greater than $95 \, \%$ reset fidelity and a $99 \, \%$ readout fidelity without any hardware overhead beyond those commonly used. This provides at least a 50x speed up compared to the passive decay of the qubit, thereby significantly increasing the data-acquisition rate.

quant-ph↗
arXiv2025

Correction Formulas for the Mølmer-Sørensen Gate Under Strong Driving

The Mølmer-Sørensen gate is a widely used entangling gate for ion platforms with inherent robustness to trap heating. The gate performance is limited by coherent errors, arising from the Lamb-Dicke (LD) approximation and sideband errors. Here, we provide explicit analytical formulas for errors up to fourth order in the LD parameter, by using the Magnus expansion to match numerical precision, and overcome significant, orders-of-magnitude underestimation of errors by previous theory methods. We show that fourth order Magnus expansion terms are unavoidable, being in fact leading order in LD, and are therefore critical to include for typical experimental fidelity ranges. We show how these errors can be dramatically reduced compared to previous theory by using analytical renormalization of the drive strength, by calibration of the Lamb-Dicke parameter, and by the use of smooth pulse shaping.

quant-ph↗
arXiv2025

Non-Markovian Ensemble Propagation

Open quantum systems are ubiquitous in nature and central to quantum technologies. A common description of their dynamics is given by the celebrated Lindblad master equation, which can be generalized to the non-Markovian scenario. In this work, we introduce the Non-Markovian Ensemble Propagation (NMEP) method, which extends the Monte Carlo Wave-Function (MCWF) method to the non-Markovian case in a simple and general manner. We demonstrate its accuracy and effectiveness in a selection of examples, and compare the results with either analytic expressions or direct numerical integration of the master equation.

quant-ph↗
arXiv2024

Limitations of Quantum Approximate Optimization in Solving Generic Higher-Order Constraint-Satisfaction Problems

The ability of the Quantum Approximate Optimization Algorithm (QAOA) to deliver a quantum advantage on combinatorial optimization problems is still unclear. Recently, a scaling advantage over a classical solver was postulated to exist for random 8-SAT at the satisfiability threshold. At the same time, the viability of quantum error mitigation for deep circuits on near-term devices has been put in doubt. Here, we analyze the QAOA's performance on random Max-$k$XOR as a function of $k$ and the clause-to-variable ratio. As a classical benchmark, we use the Mean-Field Approximate Optimization Algorithm (MF-AOA) and find that it performs better than or equal to the QAOA on average. Still, for large $k$ and numbers of layers $p$, there may remain a window of opportunity for the QAOA. However, by extrapolating our numerical results, we find that reaching high levels of satisfaction would require extremely large $p$, which must be considered rather difficult both in the variational context and on near-term devices.

quant-ph↗
arXiv2024

Emergence of noise-induced barren plateaus in arbitrary layered noise models

In variational quantum algorithms the parameters of a parameterized quantum circuit are optimized in order to minimize a cost function that encodes the solution of the problem. The barren plateau phenomenon manifests as an exponentially vanishing dependence of the cost function with respect to the variational parameters, and thus hampers the optimization process. We discuss how, and in which sense, the phenomenon of noise-induced barren plateaus emerges in parameterized quantum circuits with a layered noise model. Previous results have shown the existence of noise-induced barren plateaus in the presence of local Pauli noise [arXiv:2007.14384]. We extend these results analytically to arbitrary completely-positive trace preserving maps in two cases: 1) when a parameter-shift rule holds, 2) when the parameterized quantum circuit at each layer forms a unitary $2$-design. The second example shows how highly expressive unitaries give rise not only to standard barren plateaus [arXiv:1803.11173], but also to noise-induced ones. In the second part of the paper, we study numerically the emergence of noise-induced barren plateaus in QAOA circuits focusing on the case of MaxCut problems on $d$-regular graphs and amplitude damping noise.

quant-ph↗
arXiv2024

Co-designing Transmon devices for control with simple pulses

In the current NISQ era, there is demand for functional quantum devices to solve relevant computational problems, which motivates a utilitarian perspective on device design: The goal is to create a device that is able to run a given algorithm with state-of-the-art performance. In this work, we use optimal control tools to derive the gate set required by a toy algorithm and, in tandem, explore the model space of superconducting quantum computer design, from dispersively coupled to stronger interacting qubits, to maximize gate fidelity. We employ perfect entangler theory to provide flexibility in the search for a two-qubit gate on a given platform and to compare designs with different entangling mechanisms, e.g., $\texttt{CPHASE}$ and $\sqrt{\texttt{iSWAP}}$. To ensure the applicability of our investigation, we limit ourselves to "simple" (i.e., sparse parametrization) pulses and quantify, where results differ from using the full complexity of piecewise constant controls.

quant-ph↗
arXiv2024

Quantum heat engine based on quantum interferometry: the SU(1,1) Otto cycle

We present a quantum heat engine based on a quantum Otto cycle, whose working substance reproduces the same outcomes of a SU(1,1) interference process at the end of each adiabatic transformation. This device takes advantage of the extraordinary quantum metrological features of the SU(1,1) interferometer to better discriminate the sources of uncertainty of relevant observables during each adiabatic stroke of the cycle. Applications to circuit QED platforms are also discussed.

quant-ph↗
arXiv2024

Quantum Artificial Intelligence: A Brief Survey

Quantum Artificial Intelligence (QAI) is the intersection of quantum computing and AI, a technological synergy with expected significant benefits for both. In this paper, we provide a brief overview of what has been achieved in QAI so far and point to some open questions for future research. In particular, we summarize some major key findings on the feasability and the potential of using quantum computing for solving computationally hard problems in various subfields of AI, and vice versa, the leveraging of AI methods for building and operating quantum computing devices.

quant-ph↗
arXiv2024

Adiabatic Bottlenecks in Quantum Annealing and Nonequilibrium Dynamics of Paramagnons

The correspondence between long-range interacting quantum spin glasses and combinatorial optimization problems underpins the physical motivation for adiabatic quantum computing. On one hand, in disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. On the other hand, when solving a given instance of an optimization problem, disorder-averaged quantities are of no relevance, as one is solely interested in instance-specific, finite-size properties, in particular the true solution. Here, we apply the nonequilibrium Green-function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum along the annealing path. For the example of the quantum Sherrington-Kirkpatrick spin glass, by comparing to extensive numerically exact results, we show that this method provides access to the instance-specific bottlenecks of the annealing protocol.

cond-mat.dis-nn↗
arXiv2024

Quantum Computing Enhanced Service Ecosystem for Simulation in Manufacturing

Quantum computing (QC) and machine learning (ML), taken individually or combined into quantum-assisted ML (QML), are ascending computing paradigms whose calculations come with huge potential for speedup, increase in precision, and resource reductions. Likely improvements for numerical simulations in engineering imply the possibility of a strong economic impact on the manufacturing industry. In this project report, we propose a framework for a quantum computing-enhanced service ecosystem for simulation in manufacturing, consisting of various layers ranging from hardware to algorithms to service and organizational layers. In addition, we give insight into the current state of the art of applications research based on QC and QML, both from a scientific and an industrial point of view. We further analyse two high-value use cases with the aim of a quantitative evaluation of these new computing paradigms for industrially-relevant settings.

quant-ph↗
arXiv2024

Quantum-Inspired Fluid Simulation of 2D Turbulence with GPU Acceleration

Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which describe a spectrum of fluid phenomena, from the aerodynamics of vehicles to weather patterns. Within this quantum-inspired paradigm, velocity is encoded as matrix product states (MPS), effectively harnessing the analogy between interscale correlations of fluid dynamics and entanglement in quantum many-body physics. This particular tensor structure is also called quantics tensor train (QTT). By utilizing NVIDIA's cuQuantum library to perform parallel tensor computations on GPUs, our adaptation speeds up simulations by up to 12.1 times. This allows us to study the algorithm in terms of its applicability, scalability, and performance. By simulating two qualitatively different but commonly encountered 2D flow problems at high Reynolds numbers up to $1\times10^7$ using a fourth-order time stepping scheme, we find that the algorithm has a potential advantage over direct numerical simulations in the turbulent regime as the requirements for grid resolution increase drastically. In addition, we derive the scaling $χ=\mathcal{O}(\text{poly}(1/ε))$ for the maximum bond dimension $χ$ of MPS representing turbulent flow fields, with an error $ε$, based on the spectral distribution of turbulent kinetic energy. Our findings motivate further exploration of related quantum algorithms and other tensor network methods.

physics.flu-dyn↗
arXiv2024

Particle creation in left-handed metamaterial transmission lines

Transmission lines are excellent examples of quantum simulators of quantum fields. By appropriately driving specific circuit elements, these devices can reproduce relativistic and quantum such as particle creation due to the non-adiabatic stimulation of the quantum vacuum. We investigate particle creation in left-handed transmission lines induced by the modulation of the Josephson energy in superconducting quantum interference devices. Our results show that, as a consequence of the peculiar dispersion relations present in these systems, particle production occurs with much more favorable conditions with respect to the usual right-handed transmission lines.

quant-ph↗
arXiv2024

Quantum simulation in hybrid transmission lines

Platforms based on transmission lines are nowadays employed for the simulation of standard phenomena in quantum electrodynamics and quantum field theory. In this work, we propose a hybrid platform, in which a right-handed transmission line is connected to a left-handed transmission line by means of a superconducting quantum interference device (SQUID). We examine the interaction between the two transmission lines, as well as the excitation flow along the composed platform. We show that, by activating specific resonance conditions, this platform can be used as a quantum simulator of different phenomena in quantum optics, multimode quantum systems and quantum thermodynamics.

quant-ph↗
arXiv2023

Phonon-photon conversion as mechanism for cooling and coherence transfer

The dynamical Casimir effect is the physical phenomenon where the mechanical energy of a movable wall of a cavity confining a quantum field can be converted into quanta of the field itself. This effect has been recognized as one of the most astonishing predictions of quantum field theory. At the quantum scale, the energy conversion can also occur incoherently, namely without an physical motion of the wall. We employ quantum thermodynamics to show that this phenomenon can be employed as a tool to cool down the wall when there is a non-vanishing temperature gradient between the wall and the cavity. At the same time, the process of heat-transfer enables to share the coherence from one cavity mode, driven by a laser, to the wall, thereby forcing its coherent oscillation. Finally, we show how to employ one laser drive to cool the entire system including the case when it is composed of other subsystems.

quant-ph↗
arXiv2023

A Set of Annealing Protocols for Optimized System Dynamics and Classification of Fully Connected Spin Glass Problems

We perform exact diagonalization and time evolution of the Lechner-Hauke-Zoller (LHZ) annealing architecture [Science Advances 1(9), e1500838 (2015)] for ten physical qubits. Thereby, on a training set consisting of $2400$ problem instances, we perform the optimization task of tuning the local fields with the goal to identify a set of fixed optimal annealing protocols, that outperforms linear protocols on a large class of arbitrary LHZ problem instances. We show that average ground state fidelities of $0.9$ can be achieved by applying optimized protocols onto groups of problem instances with similar energy landscapes. Particularly, the set of optimized annealing protocols reduces annealing time required to reach a predefined threshold ground state fidelity by an average of $\sim72\%$, corresponding to a speed-up of factor $\sim3.5$. Moreover, as these protocols are meant to be readily applicable in experimental setups, they can be used as a starting point for problem-specific protocol optimization. In reverse, we discuss how previously optimized protocols can potentially be used to gauge the instantaneous energy landscape of a spin glass problem. Albeit simulations were performed on the LHZ architecture, identification of optimized protocols is not limited to either simulations or local connectivity only.

quant-ph↗