Quantum polar stabilizer codes based on polarization of pure quantum channel don't work for quantum computing

• URL: http://arxiv.org/abs/2204.11655v3
• Date: Wed, 14 Feb 2024 02:46:23 GMT
• Title: Quantum polar stabilizer codes based on polarization of pure quantum channel don't work for quantum computing
• Authors: Zhengzhong Yi, Zhipeng Liang, Yulin Wu and Xuan Wang
• Abstract summary: No one has designed a quantum polar coding scheme which applies to quantum computing yet. We propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones. We find a class of quantum stabilizer codes with coding rate 0.5 for pure Pauli X, Z and Y noise.
• Score: 9.084924083651133
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Inspired by classical polar codes, whose coding rate can asymptotically achieve the Shannon capacity, researchers are trying to find its analogue in quantum information field, which are called quantum polar codes. However, no one has designed a quantum polar coding scheme which applies to quantum computing yet. There are two intuitions in previous research. The first is that directly converting classical polar coding circuits to quantum ones will produce polarization phenomenon of pure quantum channel, which has been proved in our previous work. The second is that based on this quantum polarization phenomenon one can design a quantum polar coding scheme that applies to quantum computing. There are several previous work following the second intuition, none of which has been verified by experiments. In this paper, we follow the second intuition and propose a more reasonable quantum polar stabilizer code construction algorithm than any previous ones by using the theory of stabilizer codes. Unfortunately, simulation experiments show that even the stabilizer codes obtained from this more reasonable construction algorithm don't work, which implies that the second intuition leads to a dead end. Based on the analysis on why the second intuition don't work, we provide a possible future direction of designing quantum stabilizer codes with high coding rate by borrowing the idea of classical polar codes. following this direction, we find a class of quantum stabilizer codes with coding rate 0.5 for pure Pauli X, Z and Y noise.

Related papers

• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial [11.637855523244838]
  This paper serves as a tutorial on designing and simulating quantum encoder and decoder circuits for stabilizer codes. We present encoding and decoding circuits for five-qubit code and Steane code, along with verification of these circuits using IBM Qiskit.
  arXiv  Detail & Related papers  (2023-09-21T05:42:04Z)
• Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels [0.08702432681310403]
  We introduce and explicitly construct a quantum code we coin a "Pauli Manipulation Detection" code (or PMD), which detects every Pauli error with high probability. We apply them to construct the first near-optimal codes for two tasks in quantum communication over adversarial channels.
  arXiv  Detail & Related papers  (2023-04-13T05:05:35Z)
• Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• 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)
• 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)
• Continuous Variable Quantum Advantages and Applications in Quantum Optics [0.0]
  This thesis focuses on three main questions in the continuous variable and optical settings. Where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? What advantages can be gained in practice from the use of quantum information?
  arXiv  Detail & Related papers  (2021-02-10T02:43:27Z)
• Polar Codes for Quantum Reading [0.0]
  We show how to construct low complexity encoding schemes that are interesting for channel discrimination. We also show that the error probability of the scheme proposed decays exponentially with respect to the code length. An analysis of the optimal quantum states to be used as probes is given.
  arXiv  Detail & Related papers  (2020-12-14T01:24:11Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum error-correcting codes and their geometries [0.6445605125467572]
  This article aims to introduce the reader to the underlying mathematics and geometry of quantum error correction. We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension. This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters.
  arXiv  Detail & Related papers  (2020-07-12T13:57:39Z)
• 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)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.