A few-electron quadruple quantum dot in a closed loop

We report the realization of a quadruple quantum dot device in a square-like configuration where a single electron can be transferred on a closed path free of other electrons. By studying the stability diagrams of this system, we demonstrate that we are able to reach the few-electron regime and to control the electronic population of each quantum dot with gate voltages. This allows us to control the transfer of a single electron on a closed path inside the quadruple dot system. This work opens the route towards electron spin manipulation using spin-orbit interaction by moving an electron on complex paths free of electron

Injection of a single electron from static to moving quantum dots

We study the injection mechanism of a single electron from a static quantum dot into a moving quantum dot created in a long depleted channel with surface acoustic waves (SAWs). We demonstrate that such a process is characterized by an activation law with a threshold that depends on the SAW amplitude and the dot-channel potential gradient. By increasing sufficiently the SAW modulation amplitude, we can reach a regime where the transfer is unitary and potentially adiabatic. This study points at the relevant regime to use moving dots in quantum information protocols.Comment: 5 pages, 4 figure

Improved FPT algorithms for weighted independent set in bull-free graphs

Very recently, Thomass\'e, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time $2^{O(k^5)} \cdot n^9$. In this article we improve this running time to $2^{O(k^2)} \cdot n^7$. As a byproduct, we also improve the previous Turing-kernel for this problem from $O(k^5)$ to $O(k^2)$. Furthermore, for the subclass of bull-free graphs without holes of length at most $2p-1$ for $p \geq 3$, we speed up the running time to $2^{O(k \cdot k^{\frac{1}{p-1}})} \cdot n^7$. As $p$ grows, this running time is asymptotically tight in terms of $k$, since we prove that for each integer $p \geq 3$, Weighted Independent Set cannot be solved in time $2^{o(k)} \cdot n^{O(1)}$ in the class of $\{bull,C_4,\ldots,C_{2p-1}\}$-free graphs unless the ETH fails.Comment: 15 page

Transmission Phase in the Kondo Regime Revealed in a Two-Path Interferometer

We report on the direct observation of the transmission phase shift through a Kondo correlated quantum dot by employing a new type of two-path interferometer. We observed a clear $\pi/2$-phase shift, which persists up to the Kondo temperature $T_{\rm K}$. Above this temperature, the phase shifts by more than $\pi/2$ at each Coulomb peak, approaching the behavior observed for the standard Coulomb blockade regime. These observations are in remarkable agreement with 2-level numerical renormalization group calculations. The unique combination of experimental and theoretical results presented here fully elucidates the phase evolution in the Kondo regime.Comment: 4 pages, 3 figure

Polynomial kernelization for removing induced claws and diamonds

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique. In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edges from $G$ to obtain a (claw,diamond)-free graph. Our main result is that this problem admits a polynomial kernel. We complement this finding by proving that, even on instances with maximum degree $6$, the problem is NP-complete and cannot be solved in time $2^{o(k)}\cdot |V(G)|^{O(1)}$ unless the Exponential Time Hypothesis fai

Fast end efficient single electron transfer between distant quantum dots

International audienceLateral quantum dots are a promising system for quantum information processing devices. The required basic manipulations of a single electron spin have indeed been demonstrated. However, a stringent requirement is the ability to transfer quantum information from place to place within one sample. In this work, we explore and demonstrate the possibility to transfer a single electron between two distant quantum dots in a fast and reliable manner

Single electron quantum tomography in quantum Hall edge channels

We propose a quantum tomography protocol to measure single electron coherence in quantum Hall edge channels and therefore access for the first time the wave function of single electron excitations propagating in ballistic quantum conductors. Its implementation would open the way to quantitative studies of single electron decoherence and would provide a quantitative tool for analyzing single to few electron sources. We show how this protocol could be implemented using ultrahigh sensitivity noise measurement schemes.Comment: Version 3: long version (7 figures): corrections performed and references have been added. Figures reprocessed for better readabilit

{SETH}-Based Lower Bounds for Subset Sum and Bicriteria Path

Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T$ cannot be improved to time $T^{1-\varepsilon}\cdot 2^{o(n)}$ for any $\varepsilon>0$, unless the Strong Exponential Time Hypothesis (SETH) fails. This is one of the strongest known connections between any two of the core problems of fine-grained complexity. As a corollary, we prove a "Direct-OR" theorem for Subset-Sum under SETH, offering a new tool for proving conditional lower bounds: It is now possible to assume that deciding whether one out of $N$ given instances of Subset-Sum is a YES instance requires time $(N T)^{1-o(1)}$. As an application of this corollary, we prove a tight SETH-based lower bound for the classical Bicriteria s,t-Path problem, which is extensively studied in Operations Research. We separate its complexity from that of Subset-Sum: On graphs with $m$ edges and edge lengths bounded by $L$, we show that the $O(Lm)$ pseudo-polynomial time algorithm by Joksch from 1966 cannot be improved to $\tilde{O}(L+m)$, in contrast to a recent improvement for Subset Sum (Bringmann, SODA 2017)

Circuit Quantum Electrodynamics with a Spin Qubit

Circuit quantum electrodynamics allows spatially separated superconducting qubits to interact via a "quantum bus", enabling two-qubit entanglement and the implementation of simple quantum algorithms. We combine the circuit quantum electrodynamics architecture with spin qubits by coupling an InAs nanowire double quantum dot to a superconducting cavity. We drive single spin rotations using electric dipole spin resonance and demonstrate that photons trapped in the cavity are sensitive to single spin dynamics. The hybrid quantum system allows measurements of the spin lifetime and the observation of coherent spin rotations. Our results demonstrate that a spin-cavity coupling strength of 1 MHz is feasible.Comment: Related papers at http://pettagroup.princeton.edu