Related papers: A class of quantum synchronizable codes of length $2^n$ over ${\rm F}

A class of quantum synchronizable codes of length $2^n$ over ${\rm F}_q$

URL: http://arxiv.org/abs/2110.13659v1
Date: Mon, 25 Oct 2021 08:54:10 GMT
Title: A class of quantum synchronizable codes of length $2^n$ over ${\rm F}_q$
Authors: Shiwen Sun, Tongjiang Yan, Yuhua Sun, Tao Wang, Xueting Wang
Abstract summary: Quantum synchronizable codes (QSCs) are special quantum error-correcting codes which can be used to correct the effects of quantum noise on qubits and misalignment in block synchronization. In this paper, a new class of quantum synchronizable codes of length $2n$ are constructed by using the cyclotomic cosets, whose synchronization capabilities always reach the upper bound $2n$.
Score: 10.077987533569596
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Quantum synchronizable codes (QSCs) are special quantum error-correcting codes which can be used to correct the effects of quantum noise on qubits and misalignment in block synchronization. In this paper, a new class of quantum synchronizable codes of length $2^n$ are constructed by using the cyclotomic cosets, whose synchronization capabilities always reach the upper bound $2^n$.

Related papers

Synchronizable hybrid subsystem codes [4.14360329494344]
We establish connections between quantum synchronizable codes, subsystem codes, and hybrid codes constructed from the same pair of classical cyclic codes. We also propose a method to construct a synchronizable hybrid subsystem code which can correct both Pauli and synchronization errors.
arXiv Detail & Related papers (2024-09-17T16:11:30Z)
Creating entangled logical qubits in the heavy-hex lattice with topological codes [0.0]
In this work we show how this bug can be turned into a feature. We demonstrate entanglement between logical qubits with code distance up to $d = 4$. We verify the violation of Bell's inequality for both the $d=2$ case with post selection featuring a fidelity of $94%$.
arXiv Detail & Related papers (2024-04-24T17:02:35Z)
A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z)
Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z)
Enabling Multi-threading in Heterogeneous Quantum-Classical Programming Models [53.937052213390736]
We introduce C++-based parallel constructs to enable parallel execution of a quantum kernel. Preliminary performance results show that running two Bell kernels with 12 threads per kernel in parallel outperforms running the kernels one after the other.
arXiv Detail & Related papers (2023-01-27T06:48:37Z)
Observing Quantum Synchronization of a Single Trapped-Ion Qubit [6.814631744316089]
We show that a qubit can be synchronized to an external driving signal by using a trapped-ion system. By synchronizing the basic unit of quantum information, our research opens up the possibility of applying quantum synchronization to large-scale quantum networks.
arXiv Detail & Related papers (2022-05-12T07:54:12Z)
Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z)
A new family of quantum synchronizable codes from negacyclic codes [4.3702562340580755]
We propose a new method for construct quantum synchronizable codes from negacyclic codes. This paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.
arXiv Detail & Related papers (2021-07-06T14:39:31Z)
Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z)
Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
Quantum $\varphi$-synchronization in coupled optomechanical system with periodic modulation [0.0]
We introduce and characterize the measure of a more generalized quantum synchronization called quantum $varphi$-synchronization. Naturally, quantum synchronization and quantum anti-synchronization become special cases of quantum $varphi$-synchronization.
arXiv Detail & Related papers (2020-01-29T13:02:17Z)

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