Search NASASearch

NASA NTRS · 20150015944

2015 Summer Intern Experience

Abstract

This publication contains the detailed abstracts describing the student experiences and posters from Summer 2015.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rebecca M Flick, John Giammarino, Joaquin Martinez, Benjamin Martins, Michael Arreola-Zamora, Nathan Bell, Olivia Bosma, Taylor Jensen, Alexander Chen, Tyler Clinkaberry, Or Dantsker, Bryce Doerr, Louis Edelman, Lindsay Flasch, Logan Francisco, Jeremy Germita, Nicole Gillian, Darian Grisso, James Hamory, Nicholas Horn, John Jackson, Saba Janamian, Victoria Jenne, Emma Ruano, Lynn Valkov, Robert Kotcher, Caleb Lloyd, Loren Newton, Kurt Pauer, Jonathan Lokos, Emily Nichols, Dhvani Patel, Christian Pereira, Tommy Pestolesi, Kyle Lukacovic, Alex Petrik, Shelby Worrell, Pamela Ruffner, Savannah Shively, Billy Sitz, Patrick Sosa, Nicholas Souza, Kyler Stephens, Ethan Williams, Madison Washburn, Jacob Wilson. 2015-06-21. 2015 Summer Intern Experience. https://ntrs.nasa.gov/citations/20150015944

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Certified randomness using a trapped-ion quantum processor

Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

computer science

Heisenberg-limited Hamiltonian learning for interacting bosons

We develop a protocol for learning a class of interacting bosonic Hamiltonians from dynamics with Heisenberg-limited scaling. For Hamiltonians with an underlying bounded-degree graph structure, we can learn all parameters with root mean square error ϵ using ${\mathcal{O}}(1/\epsilon )$ total evolution time, which is independent of the system size, in a way that is robust against state-preparation and measurement error. In the protocol, we only use bosonic coherent states, beam splitters, phase shifters, and homodyne measurements, which are easy to implement on many experimental platforms. A key technique we develop is to apply random unitaries to enforce symmetry in the effective Hamiltonian, which may be of independent interest.

computer science