Jason Kestner
University of Maryland, Baltimore County
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Jason Kestner.
Nature Communications | 2012
Xin Wang; Lev S. Bishop; Jason Kestner; Edwin Barnes; Kai Sun; S. Das Sarma
Precise qubit manipulation is fundamental to quantum computing, yet experimental systems generally have stray coupling between the qubit and the environment, which hinders the necessary high-precision control. Here, we report the first theoretical progress in correcting an important class of errors stemming from fluctuations in the magnetic field gradient, in the context of the singlet-triplet spin qubit in a semiconductor double quantum dot. These errors are not amenable to correction via control techniques developed in other contexts, as here the experimenter has precise control only over the rotation rate about the z axis of the Bloch sphere, and this rate is furthermore restricted to be positive and bounded. Despite these strong constraints, we construct simple electrical pulse sequences that, for small gradients, carry out z axis rotations while cancelling errors up to the sixth order in gradient fluctuations, and for large gradients, carry out arbitrary rotations while cancelling the leading order error.
Physical Review Letters | 2013
Jason Kestner; Xin Wang; Lev S. Bishop; Edwin Barnes; S. Das Sarma
We develop a systematic method of performing corrected gate operations on an array of exchange-coupled singlet-triplet qubits in the presence of both fluctuating nuclear Overhauser field gradients and charge noise. The single-qubit control sequences we present have a simple form, are relatively short, and form the building blocks of a corrected cnot gate when also implemented on the interqubit exchange link. This is a key step towards enabling large-scale quantum computation in a semiconductor-based architecture by facilitating error reduction below the quantum error correction threshold for both single-qubit and multiqubit gate operations.
Physical Review A | 2007
Jason Kestner; L.-M. Duan
We present a solution of the three-fermion problem in a harmonic potential across a Feshbach resonance. We compare the spectrum with that of the two-body problem and show that it is energetically unfavorable for the three fermions to occupy one lattice site rather than two. We also demonstrate the existence of an energy level crossing in the ground state with a symmetry change of its wave function, suggesting the possibility of a phase transition for the corresponding many-body case.
Physical Review A | 2014
Xin Wang; Lev S. Bishop; Edwin Barnes; Jason Kestner; S. Das Sarma
We present a comprehensive theoretical treatment of supcode, a method for generating dynamically corrected quantum gate operations, which are immune to random noise in the environment, by using carefully designed sequences of soft pulses. supcode enables dynamical error suppression even when the control field is constrained to be positive and uniaxial, making it particularly suited to counteracting the effects of noise in systems subject to these constraints such as singlet-triplet qubits. We describe and explain in detail how to generate supcode pulse sequences for arbitrary single-qubit gates and provide several explicit examples of sequences that implement commonly used gates, including the single-qubit Clifford gates. We develop sequences for noise-resistant two-qubit gates for two exchange-coupled singlet-triplet qubits by cascading robust single-qubit gates, leading to a 35% reduction in gate time compared to previous works. This cascade approach can be scaled up to produce gates for an arbitrary-length spin qubit array and is thus relevant to scalable quantum computing architectures. To more accurately describe real spin qubit experiments, we show how to design sequences that incorporate additional features and practical constraints such as sample-specific charge noise models and finite pulse rise times. We provide a detailed analysis based on randomized benchmarking to show how supcode gates perform under realistic
Bulletin of the American Physical Society | 2011
Jason Kestner; Edwin Barnes; Nga T.T. Nguyen; Sankar Das Sarma
1/{f}^{\ensuremath{\alpha}}
Bulletin of the American Physical Society | 2015
Fernando Calderon-Vargas; Jason Kestner
noise and find a strong dependence of gate fidelity on the exponent
Physical Review A | 2007
Jason Kestner; L.-M. Duan
\ensuremath{\alpha}
Physical Review B | 2013
G. T. Hickman; Xin Wang; Jason Kestner; S. Das Sarma
, with best performance for
Physical Review B | 2013
Erik Nielsen; Edwin Barnes; Jason Kestner; S. Das Sarma
\ensuremath{\alpha}g1
Bulletin of the American Physical Society | 2011
Jason Kestner; B. Wang; J. D. Sau; Sankar Das Sarma
. Our supcode sequences can therefore be used to implement robust universal quantum computation while accommodating the fundamental constraints and experimental realities of singlet-triplet qubits.