Publications

Rudinger, Kenneth M.; Roi, Roi; Blume-Kohout, Robin J.; Nielsen, Erik N.; Gamble, John K.

Abstract not provided.

Rudinger, Kenneth M.; Nielsen, Erik N.; Gamble, John K.; Blume-Kohout, Robin J.

Abstract not provided.

Gamble, John K.; Frees, Adam F.; Ward, Daniel R.; Blume-Kohout, Robin J.; Eriksson, M.A.; Friesen, Mark F.; Coppersmith, S.N.

Recent advances in nanotechnology have enabled researchers to control individual quantum mechanical objects with unprecedented accuracy, opening the door for both quantum and extreme- scale conventional computation applications. As these devices become more complex, designing for facility of control becomes a daunting and computationally infeasible task. Here, motivated by ideas from compressed sensing, we introduce a protocol for the Compressed Optimization of Device Architectures (CODA). It leads naturally to a metric for benchmarking and optimizing device designs, as well as an automatic device control protocol that reduces the operational complexity required to achieve a particular output. Because this protocol is both experimentally and computationally efficient, it is readily extensible to large systems. For this paper, we demonstrate both the bench- marking and device control protocol components of CODA through examples of realistic simulations of electrostatic quantum dot devices, which are currently being developed experimentally for quantum computation.

Blume-Kohout, Robin J.; Gamble, John K.; Nielsen, Erik N.

Abstract not provided.

Proceedings of the National Academy of Sciences of the United States of America

Gamble, John K.; Wu, Xian W.; Ward, D.R.W.; Prance, J.R.P.; Kim, Dohun K.; Mohr, Robert M.; Shi, Zhan S.; Lagally, M.G.L.; Friesen, Mark F.; Coppersmith, S.N.C.; Eriksson, M.A.E.

The qubit is the fundamental building block of a quantum computer. We fabricate a qubit in a silicon double-quantum dot with an integrated micromagnet in which the qubit basis states are the singlet state and the spin-zero triplet state of two electrons. Because of the micromagnet, the magnetic field difference ΔB between the two sides of the double dot is large enough to enable the achievement of coherent rotation of the qubit’s Bloch vector around two different axes of the Bloch sphere. By measuring the decay of the quantum oscillations, the inhomogeneous spin coherence time T^*₂ is determined. Lastly, by measuring T^*₂ at many different values of the exchange coupling J and at two different values of ΔB, we provide evidence that the micromagnet does not limit decoherence, with the dominant limits on T^*₂ arising from charge noise and from coupling to nuclear spins.

Gamble, John K.; Jacobson, Noah T.; Nielsen, Erik N.; Baczewski, Andrew D.; Moussa, Jonathan E.; Montano, Ines M.; Muller, Richard P.

Abstract not provided.

arXiv posting

Gamble, John K.; Jacobson, Noah T.; Nielsen, Erik N.; Baczewski, Andrew D.; Moussa, Jonathan E.; Montano, Ines M.; Muller, Richard P.

Abstract not provided.

Gamble, John K.; Kim, Dohun K.; Simmons, C.B.S.; Prance, J.R.P.; Mohr, R.T.M.; Shi, Zhan S.; Blume-Kohout, Robin J.; Nielsen, Erik N.; Savage, D.E.S.; Lagally, M.G.L.; Friesen, Mark F.; Coppersmith, S.N.C.; Eriksson, M.A.E.

Abstract not provided.

Blume-Kohout, Robin J.; Gamble, John K.; Nielsen, Erik N.; Sterk, Jonathan D.; Mizrahi, Jonathan A.; Maunz, Peter L.

Abstract not provided.

Gamble, John K.

Abstract not provided.

Nature Physics

Blume-Kohout, Robin J.; Gamble, John K.; Nielsen, Erik N.; Mizrahi, Jonathan A.; Sterk, Jonathan D.; Maunz, Peter L.

Abstract not provided.

Journal of Computational and Theoretical Nanoscience

Rudinger, Kenneth M.; Gamble, John K.; Bach, Eric B.; Friesen, Mark F.; Joynt, Robert J.; Coppersmith, S.N.C.

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erences in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.

Physical Review Letters

Shi, Zhan S.; Simmons, C.B.S.; Prance, J.R.P.; Gamble, John K.; Koh, Teck S.; Shim, Yun-Pil S.; Hu, Xuedong H.; Savage, D.E.S.; Lagally, M.G.L.; Eriksson, M.A.E.; Friesen, Mark F.; Coppersmith, S.N.C.

We introduce a quantum dot qubit architecture that has an attractive combination of speed and fabrication simplicity. It consists of a double quantum dot with one electron in one dot and two electrons in the other. The qubit itself is a set of two states with total spin quantum numbers S² = 3/4 (S = 1/2) and S_z = - 1/2, with the two different states being singlet and triplet in the doubly occupied dot. Gate operations can be implemented electrically and the qubit is highly tunable, enabling fast implementation of one- and two-qubit gates in a simpler geometry and with fewer operations than in other proposed quantum dot qubit architectures with fast operations. Additionally, the system has potentially long decoherence times. These are all extremely attractive properties for use in quantum information processing devices.