Publications

Results 101–123 of 123

Search results

Jump to search filters

Micro-fabricated ion traps for Quantum Information Processing; Highlights and lessons learned

Maunz, Peter L.; Blume-Kohout, Robin J.; Blain, Matthew G.; Benito, Francisco; Berry, Christopher; Clark, Craig R.; Clark, Susan M.; Colombo, Anthony P.; Dagel, Amber L.; Fortier, Kevin M.; Haltli, Raymond A.; Heller, Edwin J.; Lobser, Daniel L.; Mizrahi, Jonathan; Nielsen, Erik N.; Resnick, Paul J.; Rembetski, John F.; Rudinger, Kenneth M.; Scrymgeour, David S.; Sterk, Jonathan D.; Tabakov, Boyan; Tigges, Chris P.; Van Der Wall, Jay W.; Stick, Daniel L.

Abstract not provided.

More Details
TYPE Conference Poster YEAR 2016
OSTI

Versatile Formal Methods Applied to Quantum Information

Witzel, Wayne W.; Rudinger, Kenneth M.; Sarovar, Mohan S.

Using a novel formal methods approach, we have generated computer-veri ed proofs of major theorems pertinent to the quantum phase estimation algorithm. This was accomplished using our Prove-It software package in Python. While many formal methods tools are available, their practical utility is limited. Translating a problem of interest into these systems and working through the steps of a proof is an art form that requires much expertise. One must surrender to the preferences and restrictions of the tool regarding how mathematical notions are expressed and what deductions are allowed. Automation is a major driver that forces restrictions. Our focus, on the other hand, is to produce a tool that allows users the ability to con rm proofs that are essentially known already. This goal is valuable in itself. We demonstrate the viability of our approach that allows the user great exibility in expressing state- ments and composing derivations. There were no major obstacles in following a textbook proof of the quantum phase estimation algorithm. There were tedious details of algebraic manipulations that we needed to implement (and a few that we did not have time to enter into our system) and some basic components that we needed to rethink, but there were no serious roadblocks. In the process, we made a number of convenient additions to our Prove-It package that will make certain algebraic manipulations easier to perform in the future. In fact, our intent is for our system to build upon itself in this manner.

More Details
TYPE Other Report YEAR 2015
DOIOSTI

Turbocharging Quantum Tomography

Blume-Kohout, Robin J.; Laros, James H.; Nielsen, Erik N.; Maunz, Peter L.; Scholten, Travis L.; Rudinger, Kenneth M.

Quantum tomography is used to characterize quantum operations implemented in quantum information processing (QIP) hardware. Traditionally, state tomography has been used to characterize the quantum state prepared in an initialization procedure, while quantum process tomography is used to characterize dynamical operations on a QIP system. As such, tomography is critical to the development of QIP hardware (since it is necessary both for debugging and validating as-built devices, and its results are used to influence the next generation of devices). But tomography suffers from several critical drawbacks. In this report, we present new research that resolves several of these flaws. We describe a new form of tomography called gate set tomography (GST), which unifies state and process tomography, avoids prior methods critical reliance on precalibrated operations that are not generally available, and can achieve unprecedented accuracies. We report on theory and experimental development of adaptive tomography protocols that achieve far higher fidelity in state reconstruction than non-adaptive methods. Finally, we present a new theoretical and experimental analysis of process tomography on multispin systems, and demonstrate how to more effectively detect and characterize quantum noise using carefully tailored ensembles of input states.

More Details
TYPE SAND Report YEAR 2015
DOIOSTI

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

Journal of Computational and Theoretical Nanoscience

Rudinger, Kenneth M.; Laros, James H.; Bach, Eric; Friesen, Mark; Joynt, Robert; Coppersmith, S.N.

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.

More Details
TYPE Journal Article YEAR 2013
DOIOSTI
Results 101–123 of 123
Results 101–123 of 123