SearcharxivSearch

arXiv · 2104.09541

A macroscopic object passively cooled into its quantum ground state of motion: beyond single-mode cooling

Abstract

The building blocks of Nature, namely atoms and elementary particles, are described by quantum mechanics. This fundamental theory is the ground on which physicists have built their major mathematical models [1]. Today, the unique features of quantum objects have led to the advent of promising quantum technologies [2, 3]. However, the macroscopic world is manifestly classical, and the nature of the quantum-to-classical crossover remains one of the most challenging open question of Science to date. In this respect, moving objects play a specific role [4, 5]. Pioneering experiments over the last few years have begun exploring quantum behaviour of micron-sized mechanical systems,either by passively cooling single GHz modes, or by adapting laser cooling techniques developed in atomic physics to cool specific modes far below the temperature of their surroundings [6-11]. Here instead we describe a very different approach, passive cooling of a micromechanical system down to 500 microK, reducing the average number of quanta in the fundamental vibrational mode at 15 MHz to just 0.3 (with even lower values expected for higher harmonics); the challenge being to be still able to detect the motion without disturbing the system noticeably. With such an approach higher harmonics and the surrounding environment are also cooled, leading to potentially much longer mechanical coherence times, and enabling experiments questioning mechanical wave-function collapse [12], potentially from the gravitational background [13, 14], and quantum thermodynamics [15]. Beyond the average behaviour, here we also report on the fluctuations of the fundamental vibrational mode of the device in-equilibrium with the cryostat. These reveal a surprisingly complex interplay with the local environment and allow characteristics of two distinct thermodynamic baths to be probed.

Explore related subjects

Keep this discovery

BibTeXRIS

D. Cattiaux, I. Golokolenov, S. Kumar, M. Sillanpää, L. Mercier de Lépinay, R. R. Gazizulin, X. Zhou, A. D. Armour, O. Bourgeois, A. Fefferman, E. Collin. 2021-04-19. A macroscopic object passively cooled into its quantum ground state of motion: beyond single-mode cooling. https://doi.org/10.1038/s41467-021-26457-8

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