Abstract Phase estimation algorithms are key protocols in quantum information processing. Besides applications in quantum computing, they can also be employed in metrology as they allow for fast extraction of information stored in the quantum state of a system. Here, we implement two suitably modified phase estimation procedures, the Kitaev and the semiclassical Fourier-transform algorithms, using an artificial atom realized with a superconducting transmon circuit. We demonstrate that both algorithms yield a flux sensitivity exceeding the classical shot-noise limit of the device, allowing one to approach the Heisenberg limit. Our experiment paves the way for the use of superconducting qubits as metrological devices which are potentially able to outperform the best existing flux sensors with a sensitivity enhanced by few orders of magnitude.
Abstract Phase estimation algorithms are key protocols in quantum information processing. Besides applications in quantum computing, they can also be employed in metrology as they allow for fast extraction of information stored in the quantum state of a system. Here, we implement two suitably modified phase estimation procedures, the Kitaev and the semiclassical Fourier-transform algorithms, using an artificial atom realized with a superconducting transmon circuit. We demonstrate that both algorithms yield a flux sensitivity exceeding the classical shot-noise limit of the device, allowing one to approach the Heisenberg limit. Our experiment paves the way for the use of superconducting qubits as metrological devices which are potentially able to outperform the best existing flux sensors with a sensitivity enhanced by few orders of magnitude.
We develop the quantum approach to magnetometry utilizing phase estimation algorithms, demonstrating improvements in the estimation of magnetic flux in both precision and dynamical range. We propose the modifications to conventional algorithms including the signal modulation and proximity time measurements. We demonstrate that our approach extends the dynamical range and improves the precision of magnetic flux detection. We show that our approach enhances performance of superconducting qubits and enables higher information gain without compromising dynamical range, paving the way toward achieving the Heisenberg limit. Combining adaptive algorithms with device-specific calibration, our methods bridge the gap between theoretical advancements and practical quantum sensing applications, offering a powerful framework for metrology using superconducting qubits.
Quantum metrology based on superconducting qubits offers unprecedented precision in measuring fundamental physical quantities, particularly magnetic fields. In this study, we develop a modified quantum phase estimation algorithm utilizing superconducting qubits, enhanced by optimized initial state preparation, significantly improving measurement sensitivity and reducing estimation times compared to conventional techniques. To ensure practical applicability and robustness, we incorporate advanced noise modeling, including intrinsic decoherence effects such as flux-induced noise and Purcell losses. Through detailed analytical modeling and numerical simulations, we systematically evaluate sensitivity and practical implementation constraints across various superconducting qubit architectures—transmon, fluxonium, conventional flux, and C-shunt flux qubits. Our approach quantifies the critical trade-offs between coherence, measurement dynamics, and sensitivity, identifying optimal operational regimes for high-performance quantum sensing. We introduce custom circuit simulation methods enabling the analysis and optimization of arbitrary superconducting quantum devices. Our findings provide a framework for advancing quantum-enhanced magnetometry and promise to facilitate next-generation quantum sensors for fundamental physics research, gravitational field measurements, and quantum-assisted searches for dark matter candidates.
Making use of coherence and entanglement as metrological quantum resources allows us to improve the measurement precision from the shot-noise or quantum limit to the Heisenberg limit. Quantum metrology then relies on the availability of quantum engineered systems that involve controllable quantum degrees of freedom which are sensitive to the measured quantity. Sensors operating in the qubit mode and exploiting their coherence in a phase-sensitive measurement have been shown to approach the Heisenberg scaling in precision. Here, we show that this result can be further improved by operating the quantum sensor in the qudit mode, i.e., by exploiting d rather than two levels. Specifically, we describe the metrological algorithm for using a superconducting transmon device operating in a qutrit mode as a magnetometer. The algorithm is based on the base-3 semiquantum Fourier transformation and enhances the quantum theoretical performance of the sensor by a factor of 2. Even more, the practical gain of our qutrit implementation is found in a reduction of the number of iteration steps of the quantum Fourier transformation by the factor $ln(2)/ln(3)\ensuremath{\approx}0.63$ compared to the qubit mode. We show that a two-tone capacitively coupled radio-frequency signal is sufficient for implementation of the algorithm.
Abstract Sensing and metrology are crucial in both fundamental science and practical applications. They meet the constant demand for precise data, enabling more dependable assessments of theoretical models’ validity. Sensors, now a common feature in many fields, play a vital role in applications like gravity imaging, geology, navigation, security, timekeeping, spectroscopy, chemistry, magnetometry, healthcare, and medicine. The advancements in quantum technologies have sparked interest in employing quantum systems as sensors, offering enhanced capabilities and new possibilities. This article describes the optimization of the quantum-enhanced sensing of magnetic fluxes with a Kitaev phase estimation algorithm based on frequency tunable transmon qubits. It provides the optimal flux biasing point for sensors with different qubit transition frequencies and gives an estimation of decoherence rates and achievable sensitivity. The use of 2- and 3-qubit entangled states are compared in simulation with the single-qubit case. The flux sensing accuracy reaches 10 − 8 ⋅ Φ 0 and scales inversely with time, which proves the speed-up of sensing with high ultimate accuracy.
Quantum magnetometry based on adaptive phase estimation allows for Heisenberg precision while avoiding creation and maintenance of complex entangled states. However, the absolute sensitivity is limited by the nonoptimal use of quantum resources provided by multiple-qubit devices and algorithmic realizations of the protocol. Here, addressing both issues, we advance the time-ascending phase estimation protocol by numerical improvements of Bayesian learning, i.e., sequential updating of the field distribution, and optimal exploitation of resources provided by unentangled qubits with limited coherence. Such algorithmic improvements are used to evaluate the absolute sensitivity both on a simulator and by pulsed-transmon experiments conducted on the IBMQ platform, where we take advantage of high coherence time. In addition, we compare the proficiency of separable and entangled states for magnetometry and show that, in practice, separable states provide superior performance. Flux-sensing emulation experiments demonstrate that a sensitivity of $(0.17--1.74)\ensuremath{\mu}{\mathrm{\ensuremath{\Phi}}}_{0}\phantom{\rule{4pt}{0ex}}{(\sqrt{\mathrm{Hz}})}^{\ensuremath{-}1}$ (where ${\mathrm{\ensuremath{\Phi}}}_{0}$ is the flux quantum) for a single-qubit magnetometer and $(0.06--0.65)\ensuremath{\mu}{\mathrm{\ensuremath{\Phi}}}_{0}\phantom{\rule{4pt}{0ex}}{(\sqrt{\mathrm{Hz}})}^{\ensuremath{-}1}$ for a five-qubit magnetometer can be achieved for slowly oscillating 1−−10kHz magnetic fields, which is comparable to more established experimental platforms for magnetometry.
Quantum computing is the field that studies computation using quantum mechanical systems, exploiting properties such as superposition or entanglement. The focus of this project will be on quantum phase estimation algorithms. The formalism commonly used to represent quantum algorithms as quantum circuits composed by qubits and quantum gates will be presented. Then, we will be able to explain the quantum Fourier transform (that is exponentially faster than its classical analogue) and three quantum phase estimation algorithms: Kitaev’s phase estimation (KPEA), the phase estimation algorithm based on QFT (PEA) and the iterative quantum phase estimation algorithm based on a semiclassical Fourier transform (IPEA). We will use the Qiskit framework in order to run simulations of such algorithms, and even run them in real IBM Q Experience quantum computers (specifically, we will use the 5 qubit computer ibmq_essex). Statistical post-processing techniques will be essential in order to extract a phase estimation from the results obtained. We will use two post-processing techniques: the majority and the average rule. The performance of these methods applied to the results of several simulations and executions in ibmq_essex will be studied. At last, we will talk about the possible applications of phase estimation algorithms. Phase estimation is used as a subroutine in the field of quantum simulation, allowing us to obtain several magnitudes of a quantum system such as the energy levels. We will present an efficient quantum algorithm for factoring called Shor’s algorithm. The cost of factorization with a classical computer increases exponentially with the size of the input, so this is a example of a task that cannot be solved efficiently on a classical computer, but can be solved efficiently by a quantum computer. Phase estimation is also used in the field of quantum metrology. Specifically, an N-V center can be used to measure magnetic fields with high sensitivity and spatial resolution operating at room temperature thanks to a measuring protocol based on phase estimation.