We investigate qubit lasing in the strong coupling limit. The qubit is given by a Cooper-pair box and population inversion is established by an additional third state, which can be addressed via quasiparticle tunneling. The coupling strength between oscillator and qubit is assumed to be much higher than the quasiparticle tunneling rate. We find that the photon number distribution is sub-Poissonian in this strong coupling limit.
We report on the investigation of a superconducting anharmonic multilevel circuit that is coupled to a harmonic readout resonator. We observe multiphoton transitions via virtual energy levels of our system up to the fifth excited state. The back-action of these higher-order excitations on our readout device is analyzed quantitatively and demonstrated to be in accordance with theoretical expectation. By applying a strong microwave drive we achieve multiphoton dressing within our anharmonic circuit which is dynamically coupled by a weak probe tone. The emerging higher-order Rabi sidebands and associated Autler-Townes splittings involving up to five levels of the investigated anharmonic circuit are observed. Experimental results are in good agreement with master-equation simulations.
We study a system coupled to external degrees of freedom, called bath, where we assume that the total system consisting of system and bath is in equilibrium. An expansion in the coupling between system and bath leads to a general form of the reduced density matrix of the system as a function of the bath self energy. The coupling to the bath results in a renormalization of the energies of the system and in a change of the eigenbasis. This theory is applicable to quantum emulators in thermal equilibrium. Undesired external degrees of freedom can affect their reliability. We study the influence of bosonic degrees of freedom on the state of a six qubit system.
We propose a mechanism for coupling spin qubits formed in double quantum dots to a superconducting transmission line resonator. Coupling the resonator to the gate controlling the interdot tunneling creates a strong spin qubit--resonator interaction with strength of tens of MHz. This mechanism allows operating the system at a point of degeneracy where dephasing is minimized. The transmission line can serve as a shuttle allowing for two-qubit operations, including fast generation of qubit-qubit entanglement and the implementation of a controlled-phase gate.
We study tunneling between period-2 states of a parametrically modulated oscillator. The tunneling matrix element is shown to oscillate with the varying frequency of the modulating field. The effect is due to spatial oscillations of the wave function and the related interference in the classically forbidden region. The oscillations emerge already in the ground state of the oscillator Hamiltonian in the rotating frame.
We study dephasing of a superconducting qubit due to quasiparticle tunneling through a Josephson junction. While qubit decay due to tunneling processes is well understood within a golden rule approximation, pure dephasing due to BCS quasiparticles gives rise to a divergent golden rule rate. We calculate qubit dephasing due to quasiparticle tunneling beyond lowest order approximation in coupling between qubit and quasiparticles. Summing up a certain class of diagrams we show that qubit dephasing due to purely longitudinal coupling to quasiparticles leads to a dephasing $\sim \exp(-x(t))$ where $x(t)$ is not linear in time on short time scales while it tends towards a selfconsistent calculated dephasing rate for longer times.
The qubit-mapping problem aims to assign qubits from a quantum circuit to a realistic NISQ device in order to maximize limited resources. Many algorithmic solutions for the qubit-mapping problem have been introduced, but much work remains in order to evaluate the effectiveness of a qubit-mapping algorithm with respect to mapping a circuit to devices while taking into account the noise characteristics of the device. In this work, we make progress on this question. Firstly, we introduce a noise-aware heuristic mapping algorithm which fares well when compared to brute-force and trivial mapping solutions for several benchmarks. This comparison serves to provide effective upper and lower bounds for our heuristic mapper in terms of an algorithm's success rate. Subsequently, we analyze how the performance of the mapping algorithm is affected by the characteristics of the interaction graph, which represents the interactions of qubits in a quantum circuit. We observe that as interaction-graph edges are added to benchmarks in either depth-first or breadth-first fashion, our heuristic algorithm's calculated success rate varies significantly, implying that both the amount of interaction-graph vertex degree and the distribution of edges in a quantum circuit's interaction graph play a significant role in the calculated success rate when our greedy heuristic maps to a quantum device's coupling graph. Lastly, we discovered that our heuristic algorithm provides substantial benefits over the trivial solution when mapping quantum circuits to QPUs, provided that less than approximately 75\% of the QPU is occupied. Lastly, as the size of the quantum processor in our simulation grows, so do the purported benefits from utilizing our heuristic mapper. This work takes the first steps towards the characterization of quantum algorithms with respect to efficient qubit-mapping solutions in NISQ-era devices.
The qubit-mapping problem aims to assign and route qubits of a quantum circuit onto an noisy intermediate-scale quantum (NISQ) device in an optimized fashion, with respect to some cost function. Finding an optimal solution to this problem is known to scale exponentially in computational complexity; as such, it is imperative to investigate scalable qubit-mapping solutions for NISQ computation. In this work, a noise-aware heuristic qubit-assignment algorithm (which assigns initial placements for qubits in a quantum algorithm to qubits on an NISQ device, but does not route qubits during the quantum algorithm’s execution) is presented and compared against the optimal brute-force solution, as well as a trivial qubit assignment, with the aim to quantify the performance of our heuristic qubit-assignment algorithm. We find that for small, connected-graph algorithms, our heuristic-assignment algorithm faithfully lies in between the effective upper and lower bounds given by the brute-force and trivial qubit-assignment algorithms. Additionally, we find that the topological-graph properties of quantum algorithms with over six qubits play an important role in our heuristic qubit-assignment algorithm’s performance on NISQ devices. Finally, we investigate the scaling properties of our heuristic algorithm for quantum processors with up to 100 qubits; here, the algorithm was found to be scalable for quantum-algorithms that admit path-like graphs. Our findings show that as the size of the quantum processor in our simulation grows, so do the benefits from utilizing the heuristic qubit-assignment algorithm, under particular constraints for our heuristic algorithm. This work, thus, characterizes the performance of a heuristic qubit-assignment algorithm with respect to the topological-graph and scaling properties of a quantum algorithm that one may wish to run on a given NISQ device.
