Related papers: Compression for Qubit Clocks

Compression for Qubit Clocks

URL: http://arxiv.org/abs/2209.06519v1
Date: Wed, 14 Sep 2022 09:45:53 GMT
Title: Compression for Qubit Clocks
Authors: Yuxiang Yang, Giulio Chiribella, Masahito Hayashi
Abstract summary: We propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)log n$ qubits and $(1/2)log n$ classical bits.
Score: 55.38708484314286
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Two-Ievel (qubit) clock systems are often used to perform precise measurement of time. In this work, we propose a compression protocol for $n$ identically prepared states of qubit clocks. The protocol faithfully encodes the states into $(1/2)\log n$ qubits and $(1/2)\log n$ classical bits and works even in the presence of noise. If the purity of the clock states is fixed, $(1/2)\log n$ qubits are sufficient. We also prove that this protocol requires the minimum amount of total memory among all protocols with vanishing error in the large $n$ limit.

Related papers

Quantum error correction below the surface code threshold [107.92016014248976]
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
arXiv Detail & Related papers (2024-08-24T23:08:50Z)
Fast and Accurate GHZ Encoding Using All-to-all Interactions [0.0]
Greenberger-Horne-Zeilinger (GHZ) state is an important resource for quantum technologies. We consider the task of GHZ encoding using all-to-all interactions. We propose a fast protocol that achieves GHZ encoding with high accuracy.
arXiv Detail & Related papers (2024-06-14T18:00:02Z)
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages [63.366380571397]
We study the problem of private vector mean estimation in the shuffle model of privacy where $n$ users each have a unit vector $v(i) inmathbbRd$. We propose a new multi-message protocol that achieves the optimal error using $tildemathcalOleft(min(nvarepsilon2,d)right)$ messages per user.
arXiv Detail & Related papers (2024-04-16T00:56:36Z)
Efficient Pauli channel estimation with logarithmic quantum memory [10.95781315121668]
We show that a protocol can estimate the eigenvalues of a Pauli channel to error $epsilon$ using only $O(log n/epsilon2)$ ancilla qubits and $tildeO(n2/epsilon2)$ measurements. Our results imply, to our knowledge, the first quantum learning task where logarithmically many qubits of quantum memory suffice for an exponential statistical advantage.
arXiv Detail & Related papers (2023-09-25T17:53:12Z)
Trade-offs between Entanglement and Communication [5.88864611435337]
We show that quantum simultaneous protocols with $tildeTheta(k5 log3 n)$ qubits of entanglement can exponentially outperform two-way randomized protocols with $O(k)$ qubits of entanglement. Prior to our work, only a relational separation was known.
arXiv Detail & Related papers (2023-06-02T01:49:39Z)
Tools for the analysis of quantum protocols requiring state generation within a time window [1.9021200954913475]
Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. Here, we consider a setting in which a process generates a quantum resource state with some probability $p$ in each time step. To maintain sufficient quality for an application, each resource state is discarded from the memory after $w$ time steps.
arXiv Detail & Related papers (2023-04-25T09:22:16Z)
Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
arXiv Detail & Related papers (2023-03-03T18:23:20Z)
Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
A fault-tolerant quantum computer must decode and correct errors faster than they appear. We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup. The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
arXiv Detail & Related papers (2023-01-20T04:23:00Z)
Generating $k$ EPR-pairs from an $n$-party resource state [5.617510227362658]
We show that LOCC protocols can create EPR-pairs between any $k$ disjoint pairs of parties. We also prove some lower bounds, for example showing that if $k=n/2$ then the parties must have at least $Omega(loglog n)$ qubits each.
arXiv Detail & Related papers (2022-11-11T22:18:27Z)
On Distributed Differential Privacy and Counting Distinct Elements [52.701425652208734]
We study the setup where each of $n$ users holds an element from a discrete set. The goal is to count the number of distinct elements across all users.
arXiv Detail & Related papers (2020-09-21T04:13:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.