Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Improving Quantum Clocks via Semidefinite Programming

Published

Author(s)

Michael J. Mullan, Emanuel H. Knill

Abstract

The accuracies of modern quantum logic clocks have surpassed those of standard atomic fountain clocks. These clocks also provide a greater degree of control, as before and after clock queries, we are able to apply chosen unitary operations and measurements. Here, we take advantage of these choices and present a numerical technique designed to increase the accuracy of these clocks. We use a greedy approach, minimizing the phase variance of a noisy classical oscillator with respect to a perfect frequency standard after an interrogation step; we do not optimize over successive interrogations nor over the probe times. We consider arbitrary prior frequency knowledge and compare clocks with varying numbers of ions and queries interlaced with unitary control. Our technique is based on the semidefinite programming formulation of quantum query complexity, a method first developed in the context of deriving algorithmic lower bounds. The application of semidefinite programming to an inherently continuous problem like that considered here requires discretization; we derive bounds on the error introduced and show that it can be made suitably small.
Citation
Quantum Information and Computation Journal
Volume
12
Issue
7-8

Keywords

quantum clock, adversary method, semidefinite programming, algorithms

Citation

Mullan, M. and Knill, E. (2012), Improving Quantum Clocks via Semidefinite Programming, Quantum Information and Computation Journal, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=909047 (Accessed April 15, 2024)
Created July 26, 2012, Updated February 19, 2017