arXiv subjects

S. E. Rasmussen

Publications and source records attributed to S. E. Rasmussen.

11 recordsLinked to original sources

arXiv2023

The superconducting circuit companion -- an introduction with worked examples

This tutorial aims at giving an introductory treatment of the circuit analysis of superconducting qubits, i.e., two-level systems in superconducting circuits. It also touches upon couplings between such qubits and how microwave driving and these couplings can be used for single- and two-qubit gates, as well as how to include noise when calculating the dynamics of the system. We also discuss higher-dimensional superconducting qudits. The tutorial is intended for new researchers with limited or no experience with the field but should be accessible to anyone with a bachelor's degree in physics. The tutorial introduces the basic methods used in quantum circuit analysis, starting from a circuit diagram and ending with a quantized Hamiltonian, that may be truncated to the lowest levels. We provide examples of all the basic techniques throughout the discussion, while in the last part of the tutorial we discuss several of the most commonly used circuits for quantum-information applications. This includes both worked examples of single qubits and examples of how to analyze the coupling methods that allow multiqubit operations. In several detailed appendices, we provide the interested reader with an introduction to more advanced techniques for handling larger circuit designs.

quant-ph↗

arXiv2022

Parameterized Two-Qubit Gates for Enhanced Variational Quantum Eigensolver

The variational quantum eigensolver is a prominent hybrid quantum-classical algorithm expected to impact near-term quantum devices. They are usually based on a circuit ansatz consisting of parameterized single-qubit gates and fixed two-qubit gates. We study the effect of parameterized two-qubit gates in the variational quantum eigensolver. We simulate a variational quantum eigensolver algorithm using fixed and parameterized two-qubit gates in the circuit ansatz and show that the parameterized versions outperform the fixed versions, both when it comes to best energy and reducing outliers, for a range of Hamiltonians with applications in quantum chemistry and materials science.

quant-ph↗

arXiv2022

Multiqubit state learning with entangling quantum generative adversarial networks

The increasing success of classical generative adversarial networks (GANs) has inspired several quantum versions of GANs. Fully quantum mechanical applications of such quantum GANs have been limited to one- and two-qubit systems. In this paper, we investigate the entangling quantum GAN (EQ-GAN) for multiqubit learning. We show that the EQ-GAN can learn a circuit more efficiently compared with a SWAP test. We also consider the EQ-GAN for learning eigenstates that are variational quantum eigensolver (VQE)-approximated, and find that it generates excellent overlap matrix elements when learning VQE states of small molecules. However, this does not directly translate into a good estimate of the energy due to a lack of phase estimation. Finally, we consider random state learning with the EQ-GAN for up to six qubits, using different two-qubit gates, and show that it is capable of learning completely random quantum states, something which could be useful in quantum state loading.

quant-ph↗

arXiv2022

Application of the Diamond Gate in Quantum Fourier Transformations and Quantum Machine Learning

As we are approaching actual application of quantum technology, it is essential to exploit the current quantum resources in the best possible way. With this in mind, it might not be beneficial to use the usual standard gate sets, inspired from classical logic gates, when compiling quantum algorithms when other less standardized gates currently perform better. We, therefore, consider a promising native gate, which occurs naturally in superconducting circuits, known as the diamond gate. We show how the diamond gate can be decomposed into standard gates and, using single-qubit gates, can work as a controlled-not-swap (CNS) gate. We then show how this CNS gate can create a controlled phase gate. Controlled phase gates are the backbone of the quantum Fourier transform algorithm, and we, therefore, show how to use the diamond gate to perform this algorithm. We also show how to use the diamond gate in quantum machine learning; namely, we use it to approximate non-linear functions and classify two-dimensional data.

quant-ph↗

arXiv2020

Reducing the amount of single-qubit rotations in VQE and related algorithms

With the advent of hybrid quantum classical algorithms using parameterized quantum circuits the question of how to optimize these algorithms and circuits emerges. In this paper we show that the number of single-qubit rotations in parameterized quantum circuits can be decreased without compromising the relative expressibility or entangling capability of the circuit. We also show that the performance of a variational quantum eigensolver is unaffected by a similar decrease in single-qubit rotations. We compare relative expressibility and entangling capability across different number of qubits in parameterized quantum circuits. High-dimensional qudits as a platform for hybrid quantum classical algorithms is a rarity in the literature. Therefore we consider quantum frequency comb photonics as a platform for such algorithms and show that we can obtain an relative expressibility and entangling capability comparable to the best regular parameterized quantum circuits.

quant-ph↗

arXiv2020

Simple implementation of high fidelity controlled-$i$SWAP gates and quantum circuit exponentiation of non-Hermitian gates

The $i$swap gate is an entangling swapping gate where the qubits obtain a phase of $i$ if the state of the qubits is swapped. Here we present a simple implementation of the controlled-$i$swap gate. The gate can be implemented with several controls and works by applying a single flux pulse. The gate time is independent of the number of controls, and we find high fidelities for any number of controls. We discuss an implementation of the gates using superconducting circuits and present a realistic implementation proposal, where we have taken decoherence noise and fabrication errors on the superconducting chip in to account, by Monte Carlo simulating possible errors. The general idea presented in this paper is, however, not limited to such implementations. An exponentiation of quantum gates is desired in some quantum information schemes and we therefore also present a quantum circuit for probabilistic exponentiating the $i$swap gate and other non-Hermitian gates.

quant-ph↗

arXiv2020

Single-step implementation of high fidelity $n$-bit Toffoli gate

The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits, scaling better than conventional circuit decompositions. We note that our assumptions, namely strongly coupling $n+1$ qubits and a driving frequency that scales with $n$, may break down for large systems. Still, our protocol could enhance the capabilities of intermediate scale quantum computers, and we discuss the prospects of implementing our protocol on trapped ions, Rydberg atoms, and on superconducting circuits. Simulations of the latter platform show that the Toffoli gate with two control bits attains fidelities of above 0.98 even in the presence of decoherence. We also show how similar ideas can be used to make a series of controlled-\textsc{not}-gates in a single step. We show how these can speed up the implementation of quantum error correcting codes and we simulate the encoding steps of the three-qubit bit-flip code and the seven-qubit Steane code.

quant-ph↗

arXiv2019

A coherent router for quantum networks

Scalable quantum information processing will require quantum networks of qubits with the ability to coherently transfer quantum states between the desired sender and receiver nodes. Here we propose a scheme to implement a quantum router that can direct quantum states from an input qubit to a preselected output qubit. The path taken by the transferred quantum state is controlled by the state of one or more ancilla qubits. This enables both directed transport between a sender and a number of receiver nodes, and generation of distributed entanglement in the network. We demonstrate the general idea using a two-output setup and discuss how the quantum routing may be expanded to several outputs. We also present a possible realization of our ideas with superconducting circuits.

quant-ph↗

arXiv2019

A controllable two-qubit swapping gate using superconducting circuits

In this paper we investigate a linear chain of qubits and determine that it can be configured into a conditional two-qubit swapping gate, where the first and last qubits of the chain are the swapped qubits, and the remaining middle ancilla qubits are controlling the state of the gate. The swapping gate introduces different phases on the final states depending on the initial states. In particular we focus on a chain of four qubits and show the swapping gate it implements. We simulate the chain with realistic parameters, and decoherence noise and leakage to higher excited states, and find an average fidelity of around 0.99. We propose a superconducting circuit which implements this chain of qubits and present a circuit design of the circuit. We also discuss how to operate the superconducting circuit such that the state of the gate can be controlled. Lastly, we discuss how the circuit can be straightforwardly altered and may be used to simulate Hamiltonians with non-trivial topological properties.

quant-ph↗

arXiv2018

Realizing time crystals in discrete quantum few-body systems

The exotic phenomenon of time translation symmetry breaking under periodic driving - the time crystal - has been shown to occur in many-body systems even in clean setups where disorder is absent. In this work, we propose the realization of time-crystals in few-body systems, both in the context of trapped cold atoms with strong interactions and of a circuit of superconducting qubits. We show how these two models can be treated in a fairly similar way by adopting an effective spin chain description, to which we apply a simple driving protocol. We focus on the response of the magnetization in the presence of imperfect pulses and interactions, and show how the results can be interpreted, in the cold atomic case, in the context of experiments with trapped bosons and fermions. Furthermore, we provide a set of realistic parameters for the implementation of the superconducting circuit.

quant-ph↗

arXiv2017

Window for Efimov physics for few-body systems with finite-range interactions

We investigate the two lowest-lying weakly bound states of $N \leq 8$ bosons as functions of the strength of two-body Gaussian interactions. We observe the limit for validity of Efimov physics. We calculate energies and second radial moments as functions of scattering length. For identical bosons we find that two $(N-1)$-body states appear before the $N$-body ground states become bound. This pattern ceases to exist for $N \geq 7$ where the size of the ground state becomes smaller than the range of the two-body potential. All mean-square-radii for $N \geq 4$ remain finite at the threshold of zero binding, where they vary as $(N-1)^{p}$ with $p=-3/2,-3$ for ground and excited states, respectively. Decreasing the mass of one particle we find stronger binding and smaller radii. The identical particles form a symmetric system, while the lighter particle is further away in the ground states. In the excited states we find the identical bosons either surrounded or surrounding the light particle for few or many bosons, respectively. We demonstrate that the first excited states for all strengths resemble two-body halos of one particle weakly bound to a dense $N$-body system for $N=3,4$. This structure ceases to exist for $N \geq 5$.

quant-ph↗