arXiv subjects

Göran Johansson

Publications and source records attributed to Göran Johansson.

At least 19 recordsLinked to original sources

arXiv2026

Analog quantum simulation of bosonic and anyonic models with flux-driven transmons

When quantum particles interact, many-body phenomena that are hard to simulate classically emerge. Quantum analog simulation offers an alternative in which the target system's dynamics is directly realized in controllable quantum hardware. Here, we give a general protocol for simulating the Bose-Hubbard and anyon-Hubbard models using lattices of capacitively coupled flux-tunable transmons. By modulating the transmon frequencies in an alternating pattern, we resonantly drive multiple many-body transitions and can tune the on-site interaction and density-dependent hopping amplitudes for up to three bosons per site, with no additional restriction on the total particle number. By adding phases to the modulation, which renders the transition amplitudes complex-valued, we propose the first simulation protocol for the anyon-Hubbard model with transmons. Numerical simulations of the driven transmon arrays with experimentally realistic parameters reproduce the characteristic dynamics of the target models across a range of interaction strengths and statistical phases, including the interaction-dependent localization and the statistics-dependent asymmetry of the anyonic quantum walk.

quant-ph↗

arXiv2026

Designing lattice proteins with variational quantum algorithms

Quantum heuristics have shown promise in solving various optimization problems, including lattice protein folding. Equally relevant is the inverse problem, protein design, where one seeks sequences that fold to a given target structure. The latter problem is often split into two steps: (i) searching for sequences that minimize the energy in the target structure, and (ii) testing whether the generated sequences fold to the desired structure. Here, we investigate the utility of variational quantum algorithms for the first of these two steps on today's noisy intermediate-scale quantum devices. We focus on the sequence optimization task, which is less resource-demanding than folding computations. We test the quantum approximate optimization algorithm and variants of it, with problem-informed quantum circuits, as well as the hardware-efficient ansatz, with problem-agnostic quantum circuits. While the former approach, with a careful choice of mixer, yields good results in noiseless simulations (success probability $\geq$0.95 in all instances), its performance drops drastically under noise. With the problem-agnostic circuits, which are more compatible with hardware constraints, improved performance is observed in noisy simulations, compared to their problem-informed counterparts. When running the problem-agnostic circuits on a real quantum device, with parameters taken from simulations, we obtain a significant success probability ($\geq$0.2) in most instances.

quant-ph↗

arXiv2026

Programmable generation of flying cat-qubits

We propose a framework for the direct generation of flying cat-qubit states from vacuum using time-dependent two-photon drives in nonlinear bosonic systems. We study both Kerr-based and two-photon-dissipation-based generation. By engineering Kerr nonlinearity, two-photon driving, and dissipation, we demonstrate logical control of a cat qubit during its generation and emission, while its quantum information is simultaneously shared between the nonlinear system and the propagating output field. We further analyze the effects of photon loss and pure dephasing, showing that both the state generation and logical control remain robust under realistic noise conditions. These results provide a route toward programmable bosonic quantum networks and future propagating error-correctable encodings.

quant-ph↗

arXiv2025

Efficient Quantum Protein Structure Prediction with Problem-Agnostic Ansatzes

Accurately predicting protein structures from amino acid sequences remains a fundamental challenge in computational biology, with profound implications for understanding biological functions and enabling structure-based drug discovery. Quantum computing approaches based on coarse-grained lattice models combined with variational algorithms have been proposed as an initial step towards predicting protein structures using quantum computers. In this work, we introduce a more efficient quantum protein structure prediction workflow that bypasses the need for explicit Hamiltonian construction by employing a problem-agnostic ansatz. The ansatz is trained to minimize an energy-based cost function that can be efficiently computed on classical computers, eliminating the need for ancillary qubits and reducing circuit depth compared to previous Hamiltonian-based methods. This enables a more scalable approach for larger proteins and facilitates the inclusion of higher-order interactions, previously hard to achieve in quantum approaches. We validate our method by benchmarking a hardware-efficient ansatz on a large set of proteins with up to 26 amino acids, modeled on the tetrahedral, body-centered cubic, and face-centered cubic lattices, incorporating up to second-nearest-neighbor interactions. We assess the performance on both a noise-free simulator and the ibm_kingston quantum computer using a set of distinct metrics to probe different aspects of the prediction quality. These experiments push the boundaries of quantum methods for protein structure prediction, targeting sequences that are longer than those typically addressed in prior studies. Overall, the results highlight the scalability and versatility of our approach, while also identifying key areas for improvement to inform future algorithm development and hardware advancements.

quant-ph↗

arXiv2025

Deterministic generation of frequency-bin-encoded microwave photons

A distributed quantum computing network requires a quantum communication channel between spatially separated processing units. In superconducting circuits, such a channel can be implemented based on propagating microwave photons to encode and transfer quantum information between an emitter and a receiver. However, traveling microwave photons can be lost during the transmission, leading to the failure of information transfer. Heralding protocols can be used to detect such photon losses. In this work, we propose such a protocol and experimentally demonstrate a frequency-bin encoding method of microwave photonic modes using superconducting circuits. We deterministically encode the quantum information from a superconducting qubit by simultaneously emitting its information into two photonic modes at different frequencies, with a process fidelity of 90.4%. The frequency-bin-encoded photonic modes can be used, at the receiver processor, to detect the occurrence of photon loss. Our work thus provides a reliable method to implement high-fidelity quantum state transfer in a distributed quantum computing network, incorporating error detection to enhance performance and accuracy.

quant-ph↗

arXiv2025

Superbunching from coherently driven atoms in a waveguide

We investigate the scattered field from $N$ identical two-level atoms resonantly driven by a weak coherent field in a one-dimensional waveguide. For atoms separated by the drive wavelength, increasing the number of atoms progressively suppresses transmission while enhancing photon bunching. Transmission becomes a superbunched $(N+1)$-photon scattering process that is predominantly incoherent. Remarkably, we find that this transmission is only possible through a process where all $N$ atoms are excited, enabling heralded multi-photon state generation with applications in long-distance entanglement and quantum metrology.

quant-ph↗

arXiv2025

Lecture notes on quantum computing

These are the lecture notes of the master's course "Quantum Computing", taught at Chalmers University of Technology every fall since 2020, with participation of students from RWTH Aachen and Delft University of Technology. The aim of this course is to provide a theoretical overview of quantum computing, excluding specific hardware implementations. Topics covered in these notes include quantum algorithms (such as Grover's algorithm, the quantum Fourier transform, phase estimation, and Shor's algorithm), variational quantum algorithms that utilise an interplay between classical and quantum computers [such as the variational quantum eigensolver (VQE) and the quantum approximate optimisation algorithm (QAOA), among others], quantum error correction, various versions of quantum computing (such as measurement-based quantum computation, adiabatic quantum computation, and the continuous-variable approach to quantum information), the intersection of quantum computing and machine learning, and quantum complexity theory. Lectures on these topics are compiled into 12 chapters, most of which contain a few suggested exercises at the end, and interspersed with four tutorials, which provide practical exercises as well as further details. At Chalmers, the course is taught in seven weeks, with three two-hour lectures or tutorials per week. It is recommended that the students taking the course have some previous experience with quantum physics, but not strictly necessary.

quant-ph↗

arXiv2025

Impact of decoherence on the fidelity of quantum gates leaving the computational subspace

The fidelity of quantum operations is often limited by incoherent errors, which typically can be modeled by fundamental Markovian noise processes such as amplitude damping and dephasing. In Phys. Rev. Lett. 129, 150504 (2022; https://doi.org/10.1103/PhysRevLett.129.150504), we presented an analytical result for the average gate fidelity of a general multiqubit operation in terms of the dissipative rates and the corresponding Lindblad jump operators, provided that the operation remains in the computational subspace throughout the time evolution. Here we generalize this expression for the average gate fidelity to include the cases where the system state temporarily leaves the computational subspace during the gate. Such gate mechanisms are integral to several quantum-computing platforms, and our formula is applicable to all of them; as examples, we employ it for the two-qubit controlled-Z gate in both superconducting qubits and neutral atoms. We also obtain the average gate fidelity for simultaneous operations applied in multiqubit systems. These results are useful for understanding the error budgets of quantum gates while scaling up quantum computers.

quant-ph↗

arXiv2023

Resource analysis of quantum algorithms for coarse-grained protein folding models

Protein folding processes are a vital aspect of molecular biology that is hard to simulate with conventional computers. Quantum algorithms have been proven superior for certain problems and may help tackle this complex life science challenge. We analyze the resource requirements for simulating protein folding on a quantum computer, assessing this problem's feasibility in the current and near-future technological landscape. We calculate the minimum number of qubits, interactions, and two-qubit gates necessary to build a heuristic quantum algorithm with the specific information of a folding problem. Particularly, we focus on the resources needed to build quantum operations based on the Hamiltonian linked to the protein folding models for a given amino acid count. Such operations are a fundamental component of these quantum algorithms, guiding the evolution of the quantum state for efficient computations. Specifically, we study course-grained folding models on the lattice and the fixed backbone side-chain conformation model and assess their compatibility with the constraints of existing quantum hardware given different bit-encodings. We conclude that the number of qubits required falls within current technological capabilities. However, the limiting factor is the high number of interactions in the Hamiltonian, resulting in a quantum gate count unavailable today.

quant-ph↗

arXiv2023

The Multimode Character of Quantum States Released from a Superconducting Cavity

Quantum state transfer by propagating wave packets of electromagnetic radiation requires tunable couplings between the sending and receiving quantum systems and the propagation channel or waveguide. The highest fidelity of state transfer in experimental demonstrations so far has been in superconducting circuits. Here, the tunability always comes together with nonlinear interactions, arising from the same Josephson junctions that enable the tunability. The resulting non-linear dynamics correlates the photon number and spatio-temporal degrees of freedom and leads to a multi-mode output state, for any multi-photon state. In this work, we study as a generic example the release of complex quantum states from a superconducting resonator, employing a flux tunable coupler to engineer and control the release process. We quantify the multi-mode character of the output state and discuss how to optimize the fidelity of a quantum state transfer process with this in mind.

quant-ph↗

arXiv2023

Unconventional saturation effects at intermediate drive in a lossy cavity coupled to few emitters

Recent technological advancements have enabled strong light-matter interaction in highly dissipative cavity-emitter systems. However, in these systems, which are well described by the Tavis-Cummings model, the considerable loss rates render the realization of many desirable nonlinear effects, such as saturation and photon blockade, problematic. Here we present another effect occurring within the Tavis-Cummings model: a nonlinear response of the cavity for resonant external driving of intermediate strength, which makes use of large cavity dissipation rates. In this regime, $(N+1)$-photon processes dominate when the cavity couples to $N$ emitters. We explore and characterize this effect in detail, and provide a picture of how the effect occurs due to destructive interference between the emitter ensemble and the external drive. We find that a central condition for the observed effect is large cooperativity, i.e., the product of the cavity and emitter decay rates is much smaller than the collective cavity-emitter interaction strength squared. Importantly, this condition does not require strong coupling. We also find an analytical expression for the critical drive strength at which the effect appears. Our results have potential for quantum state engineering, e.g., photon filtering, and could be used for the characterization of cavity-emitter systems where the number of emitters is unknown. In particular, our results open the way for investigations of unique quantum-optics applications in a variety of platforms that neither require high-quality cavities nor strong coupling.

quant-ph↗

arXiv2022

The Quantum Approximate Optimization Algorithm performance with low entanglement and high circuit depth

Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot simulate them classically for intermediate sizes. Since entanglement lies at the core of quantum computing power, we investigate its role in these heuristic methods for solving optimization problems. In particular, we use matrix product states to simulate the quantum approximate optimization algorithm with reduced bond dimensions $D$, a parameter bounding the system entanglement. Moreover, we restrict the simulation further by deterministically sampling solutions. We conclude that entanglement plays a minor role in the MaxCut and Exact Cover 3 problems studied here since the simulated algorithm analysis, with up to $60$ qubits and $p=100$ algorithm layers, shows that it provides solutions for bond dimension $D \approx 10$ and depth $p \approx 30$. Additionally, we study the classical optimization loop in the approximated algorithm simulation with $12$ qubits and depth up to $p=4$ and show that the approximated optimal parameters with low entanglement approach the exact ones.

quant-ph↗

arXiv2022

Extensive characterization of a family of efficient three-qubit gates at the coherence limit

While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to decoherence. Using superconducting qubits, we have implemented a three-qubit gate by simultaneously applying two-qubit operations, thereby realizing a three-body interaction. This method straightforwardly extends to other quantum hardware architectures, requires only a "firmware" upgrade to implement, and is faster than its constituent two-qubit gates. The three-qubit gate represents an entire family of operations, creating flexibility in quantum-circuit compilation. We demonstrate a gate fidelity of $97.90\%$, which is near the coherence limit of our device. We then generate two classes of entangled states, the GHZ and W states, by applying the new gate only once; in comparison, decompositions into the standard gate set would have a two-qubit gate depth of two and three, respectively. Finally, we combine characterization methods and analyze the experimental and statistical errors on the fidelity of the gates and of the target states.

quant-ph↗

arXiv2022

Building Blocks of a Flip-Chip Integrated Superconducting Quantum Processor

We have integrated single and coupled superconducting transmon qubits into flip-chip modules. Each module consists of two chips -- one quantum chip and one control chip -- that are bump-bonded together. We demonstrate time-averaged coherence times exceeding $90\,μs$, single-qubit gate fidelities exceeding $99.9\%$, and two-qubit gate fidelities above $98.6\%$. We also present device design methods and discuss the sensitivity of device parameters to variation in interchip spacing. Notably, the additional flip-chip fabrication steps do not degrade the qubit performance compared to our baseline state-of-the-art in single-chip, planar circuits. This integration technique can be extended to the realisation of quantum processors accommodating hundreds of qubits in one module as it offers adequate input/output wiring access to all qubits and couplers.

quant-ph↗

arXiv2022

A Shortcut to Self-Consistent Light-Matter Interaction and Realistic Spectra from First-Principles

We introduce a simple approach how an electromagnetic environment can be efficiently embedded into state-of-the-art electronic structure methods, taking the form of radiation-reaction forces. We demonstrate that this self-consistently provides access to radiative emission, natural linewidth, Lamb shifts, strong-coupling, electromagnetically induced transparency, Purcell-enhanced and superradiant emission. As an example, we illustrate its seamless integration into time-dependent density-functional theory with virtually no additional cost, presenting a convenient shortcut to light-matter interactions.

quant-ph↗

arXiv2021

Universal fidelity reduction of quantum operations from weak dissipation

Quantum information processing is in real systems often limited by dissipation, stemming from remaining uncontrolled interaction with microscopic degrees of freedom. Given recent experimental progress, we consider weak dissipation, resulting in a small error probability per operation. Here, we find a simple formula for the fidelity reduction of any desired quantum operation. Interestingly, this reduction is independent of the specific operation; it depends only on the operation time and the dissipation. Using our formula, we investigate the situation where dissipation in different parts of the system have correlations, which is detrimental for the successful application of quantum error correction. Surprisingly, we find that a large class of correlations gives the same fidelity reduction as uncorrelated dissipation of similar strength.

quant-ph↗

arXiv2021

Fast multi-qubit gates through simultaneous two-qubit gates

Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such devices. One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multi-qubit gates, which entangle three or more qubits in a single step. Here, we show that such multi-qubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits where at least one qubit is involved in two or more of the two-qubit gates. Multi-qubit gates implemented in this way are as fast as, or sometimes even faster than, the constituent two-qubit gates. Furthermore, these multi-qubit gates do not require any modification of the quantum processor, but are ready to be used in current quantum-computing platforms. We demonstrate this idea for two specific cases: simultaneous controlled-Z gates and simultaneous iSWAP gates. We show how the resulting multi-qubit gates relate to other well-known multi-qubit gates and demonstrate through numerical simulations that they would work well in available quantum hardware, reaching gate fidelities well above 99 %. We also present schemes for using these simultaneous two-qubit gates to swiftly create large entangled states like Dicke and Greenberg-Horne-Zeilinger states.

quant-ph↗

arXiv2021

Propagating Wigner-Negative States Generated from the Steady-State Emission of a Superconducting Qubit

We experimentally demonstrate the steady-state generation of propagating Wigner-negative states from a continuously driven superconducting qubit. We reconstruct the Wigner function of the radiation emitted into propagating modes defined by their temporal envelopes, using digital filtering. For an optimized temporal filter, we observe a large Wigner logarithmic negativity, in excess of 0.08, in agreement with theory. The fidelity between the theoretical predictions and the states generated experimentally is up to 99%, reaching state-of-the-art realizations in the microwave frequency domain. Our results provide a new way to generate and control nonclassical states, and may enable promising applications such as quantum networks and quantum computation based on waveguide quantum electrodynamics.

quant-ph↗