A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

So far, superconducting quantum computers have certain constraints on qubit connectivity,
such as nearest-neighbor couplings. To overcome this limitation, we propose a scalable …

The core objective of machine-assisted scientific discovery is to learn physical laws from
experimental data without prior knowledge of the systems in question. In the area of …

The variational quantum imaginary time-evolution algorithm is efficient in finding the ground
state of a quantum Hamiltonian. This algorithm involves solving a system of linear equations …

We consider a purely mechanical quantum cycle comprised of adiabatic and isoenergetic
processes. In the latter, the system interacts with an energy bath kee** constant the …

This thesis devotes three introductory chapters to outlining basic recipes for constructing the
quantum Hamiltonian of an arbitrary superconducting circuit, starting from classical circuit …

Expanding the benefits of quantum computing to new domains remains a challenging task.
Quantum applications are concentrated in only a few domains, and driven by these few, the …

We propose a superconducting circuit platform for simulating spin-1 models. To this purpose
we consider a chain of N ultrastrongly coupled qubit-resonator systems interacting through a …

We study quantum state transfer between two qubits coupled to a common quantum bus that
is constituted by an ultrastrong coupled light-matter system. By tuning both qubit frequencies …

Apart from fundamental interests in light–matter interaction at the USC regime, the
ultrastrong coupled qubit–cavity system or quantum Rabi system (QRS) is also extensively …