Related papers: Degradation of a quantum reference frame
Inertial effects in non-inertial reference frames are compared with quantum properties of tests objects. The real space-time and perfect inertial reference frame can be compared accurate to the uncertainty relation. Complexities if…
Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low…
We present a multifractal analysis of time series data obtained by repeatedly running a single-qubit quantum circuit on IBM superconducting quantum computers, in which the measurement outcomes are recorded as the number of zeros. By…
We study the long-time evolution of a quantum memory coupled to a bosonic environment on which quantum error correction (QEC) is performed using the surface code. The memory's evolution encompasses $N$ QEC cycles, each of them yielding a…
IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. For time-independent systems with fewer than three spins, we compute the exact time evolution at arbitrary times and measure spin…
We present a general framework for sensitivity optimization in quantum parameter estimation schemes based on continuous (indirect) observation of a dynamical system. As an illustrative example, we analyze the canonical scenario of…
Quantum nondemolition (QND) measurements are a precious resource for quantum information processing. Repetitive QND measurements can boost the fidelity of qubit preparation and measurement, even when the underlying single-shot measurements…
IAU 2000 resolutions on the reference frames set up a solid theoretical foundation for implementing general relativity in astronomical data processing algorithms and for unambiguous interpretation of measured relativistic effects. We…
We design machines that learn how to rotate a quantum bit about an initially unknown direction, encoded in the state of a spin-j particle. We show that a machine equipped with a quantum memory of O(log j) qubits can outperform all machines…
The recurrence time is the time a process first returns to its initial state. Using quantum walks on a graph, the recurrence time is defined through stroboscopic monitoring of the arrival of the particle to a node of the system. When the…
The parametrisation method for invariant manifolds is a powerful technique for deriving reduced-order models in the context of nonlinear vibrating systems, allowing accurate computations of nonlinear normal modes. Thanks to arbitrary order…
Realizing the promise of quantum information processing remains a daunting task, given the omnipresence of noise and error. Adapting noise-resilient classical computing modalities to quantum mechanics may be a viable path towards near-term…
Quantum sensing explores protocols using the quantum resource of sensors to achieve highly sensitive measurement of physical quantities. The conventional schemes generally use unitary dynamics to encode quantities into sensor states. In…
Quantum physics holds the promise of enabling certain tasks with better performance than possible when only classical resources are employed. The quantum phenomena present in many experiments signify nonclassical behavior, but do not always…
We consider the concept of a rotating reference frame with the axis of rotation at each point and the applicability of this concept to different areas of physics. The transformation for the transition from the resting to rotating frame is…
Feedback-driven quantum reservoir computing has so far been studied primarily in gate-based architectures, motivating alternative scalable, hardware-friendly physical platforms. Here we investigate a linear-optical quantum reservoir…
Quantum magnetometers based on spin defects in solids enable sensitive imaging of various magnetic phenomena, such as ferro- and antiferromagnetism, superconductivity, and current-induced fields. Existing protocols primarily focus on static…
Architectures for quantum computing can only be scaled up when they are accompanied by suitable benchmarking techniques. The document provides a comprehensive overview of the state and recommendations for systematic benchmarking of quantum…
We describe a simple randomized benchmarking protocol for quantum information processors and obtain a sequence of models for the observable fidelity decay as a function of a perturbative expansion of the errors. We are able to prove that…
We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using…