Engineering Papers⌕ Search

Engineering topics

Combes, Joshua

Publications and source records attributed to Combes, Joshua.

Perspective: Reproducible Coherence Characterization of Superconducting Quantum Devices

As the field of superconducting quantum computing approaches maturity, optimization of single-device performance is proving to be a promising avenue towards large-scale quantum computers. However, this optimization is possible only if performance metrics can be accurately compared among measurements, devices, and laboratories. Currently such comparisons are inaccurate or impossible due to understudied errors from a plethora of sources. In this Perspective, we outline the current state of error analysis for qubits and resonators in superconducting quantum circuits, and discuss what future investigations are required before superconducting quantum device optimization can be realized.

McRae, Corey H.↗

Noise in phase-preserving linear amplifiers

The purpose of a phase-preserving linear amplifier is to make a small signal larger, so that it can be perceived by instruments incapable of resolving the original signal, while sacrificing as little as possible in signal-to-noise. Quantum mechanics limits how well this can be done: the noise added by the amplifier, referred to the input, must be at least half a quantum at the operating frequency. This well-known quantum limit only constrains the second moments of the added noise. Here we provide the quantum constraints on the entire distribution of added noise: any phasepreserving linear amplifier is equivalent to a parametric amplifier with a physical state σ for the ancillary mode; σ determines the properties of the added noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Characterization of a qubit Hamiltonian using adaptive measurements in a fixed basis

We investigate schemes for Hamiltonian parameter estimation of a two-level system using repeated measurements in a fixed basis. The simplest (Fourier based) schemes yield an estimate with a mean-square error (MSE) that decreases at best as a power law {approx}N{sup -2} in the number of measurements N. By contrast, we present numerical simulations indicating that an adaptive Bayesian algorithm, where the time between measurements can be adjusted based on prior measurement results, yields a MSE which appears to scale close to exp(-0.3N). That is, measurements in a single fixed basis are sufficient to achieve exponential scaling in N.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rapid purification of quantum systems by measuring in a feedback-controlled unbiased basis

Rapid purification by feedback--specifically, reducing the mean impurity faster than by measurement alone--can be achieved by choosing the eigenbasis of the density matrix to be unbiased relative to the measurement basis. Here we further examine the protocol introduced by Combes and Jacobs [Phys. Rev. Lett. 96, 010504 (2006)] involving continuous measurement of the observable J{sub z} for a D-dimensional system. We rigorously rederive the lower bound (2/3)(D+1) on the achievable speedup factor and also an upper bound, namely D{sup 2}/2, for all feedback protocols that use measurements in unbiased bases. Finally, we extend our results to n independent measurements on a register of n qubits and derive an upper bound on the achievable speedup factor that scales linearly with n.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Replacing quantum feedback with open-loop control and quantum filtering

Feedback control protocols can stabilize and enhance the operation of quantum devices, however, unavoidable delays in the feedback loop adversely affect their performance. We introduce a quantum control methodology, combining open-loop control with quantum filtering, which is not constrained by feedback delays. For the problems studied (rapid purification and rapid measurement) we analytically derive lower bounds on the control performance that are comparable with the best corresponding bounds for feedback protocols.

43 PARTICLE ACCELERATORS↗