Search arXivSearch

arXiv · 1103.2144

Sideband Cooling Micromechanical Motion to the Quantum Ground State

Abstract

The advent of laser cooling techniques revolutionized the study of many atomic-scale systems. This has fueled progress towards quantum computers by preparing trapped ions in their motional ground state, and generating new states of matter by achieving Bose-Einstein condensation of atomic vapors. Analogous cooling techniques provide a general and flexible method for preparing macroscopic objects in their motional ground state, bringing the powerful technology of micromechanics into the quantum regime. Cavity opto- or electro-mechanical systems achieve sideband cooling through the strong interaction between light and motion. However, entering the quantum regime, less than a single quantum of motion, has been elusive because sideband cooling has not sufficiently overwhelmed the coupling of mechanical systems to their hot environments. Here, we demonstrate sideband cooling of the motion of a micromechanical oscillator to the quantum ground state. Entering the quantum regime requires a large electromechanical interaction, which is achieved by embedding a micromechanical membrane into a superconducting microwave resonant circuit. In order to verify the cooling of the membrane motion into the quantum regime, we perform a near quantum-limited measurement of the microwave field, resolving this motion a factor of 5.1 from the Heisenberg limit. Furthermore, our device exhibits strong-coupling allowing coherent exchange of microwave photons and mechanical phonons. Simultaneously achieving strong coupling, ground state preparation and efficient measurement sets the stage for rapid advances in the control and detection of non-classical states of motion, possibly even testing quantum theory itself in the unexplored region of larger size and mass.

Explore related subjects

Keep this discovery

BibTeXRIS

J. D. Teufel, T. Donner, Dale Li, J. H. Harlow, M. S. Allman, K. Cicak, A. J. Sirois, J. D. Whittaker, K. W. Lehnert, R. W. Simmonds. 2011-03-10. Sideband Cooling Micromechanical Motion to the Quantum Ground State. https://doi.org/10.1038/nature10261

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

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph