Related papers: Quantum Gate Generation by T-Sampling Stabilizatio…
Large language models (LLMs) can generate structured artifacts, but using them as dependable optimizers for scientific design requires a mechanism for iterative improvement under black-box evaluation. Here, we cast quantum circuit synthesis…
As quantum computers and simulators begin to produce results that cannot be verified classically, it becomes imperative to develop a variety of tools to detect and diagnose experimental errors on these devices. While state or process…
Quantum reservoir computing has emerged as a promising machine learning paradigm for processing temporal data on near-term quantum devices, as it allows for exploiting the large computational capacity of the qubits without suffering from…
In this thesis, we study concepts in quantum computing using graphical languages, specifically using the ZX-calculus. The core of the research revolves around (graphical) stabilizer decompositions. The first major focus is on the…
A novel two-qubit entangling gate for trapped-ion quantum processors is proposed theoretically and demonstrated experimentally. During the gate, double-dressed quantum states are created by applying a phase-modulated continuous driving…
We demonstrate complete characterization of a two-qubit entangling process - a linear optics controlled-NOT gate operating with coincident detection - by quantum process tomography. We use maximum-likelihood estimation to convert the…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
We study the self-triggered stabilization of discrete-time linear systems with quantized state measurements. In the networked control system we consider, sensors may be spatially distributed and be connected to a self-triggering mechanism…
We introduce a fully tuneable entangling gate for continuous-variable one-way quantum computation. We present a proof-of-principle demonstration by propagating two independent optical inputs through a three-mode linear cluster state and…
Quantum random number generators (QRNGs) produce random numbers based on the intrinsic probabilistic nature of quantum mechanics, making them true random number generators (TRNGs). In this paper, we design and fabricate an embedded QRNG…
We propose a method to achieve scalable quantum computation based on fast quantum gates on an array of trapped ions, without the requirement of ion shuttling. Conditional quantum gates are obtained for any neighboring ions through…
Optimal control theory is applied to analyze the time-optimal solution with a single scalar control knob in a two-level quantum system without quantum decoherence. Emphasis is \change{placed} on the dependence on the maximum control…
Quantum random number generation exploits inherent randomness of quantum mechanical processes and measurements. Real-time generation rate of quantum random numbers is usually limited by electronic bandwidth and data processing rates. Here…
This dissertation presents and prove the viability of a non-standard method for controlling the state of a quantum system by modifying its boundary conditions instead of relying on the action of external fields. The standard approach to…
Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…
Topological quantum computation has been extensively studied due to its robustness against decoherence. A conventional way to realize it is by adiabatic operations---it requires relatively long time to accomplish so that the speed of…
This thesis explores the concept of realizing quantum gates using physical systems like atoms and oscillators perturbed by electric and magnetic fields. The basic idea is that if a time-independent Hamiltonian $H_0$ is perturbed by a…
Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. Demonstrations of such processes have, however, been limited to probabilistic sources, for instance, spontaneous parametric…
High-fidelity logical \emph{T}-gate realization constitutes a core prerequisite for large-scale fault-tolerant quantum computing. However, conventional magic state distillation requires massive physical qubit overhead across successive…
The universality theorem in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. However, the process of such decomposition is generally…