Quantum error correction is a technique that enhances a system’s ability to combat noise by encoding logical information into additional quantum bits,which plays a key role in building practical quantum computers.The...Quantum error correction is a technique that enhances a system’s ability to combat noise by encoding logical information into additional quantum bits,which plays a key role in building practical quantum computers.The XZZX surface code,with only one stabilizer generator on each face,demonstrates significant application potential under biased noise.However,the existing minimum weight perfect matching(MWPM)algorithm has high computational complexity and lacks flexibility in large-scale systems.Therefore,this paper proposes a decoding method that combines graph neural networks(GNN)with multi-classifiers,the syndrome is transformed into an undirected graph,and the features are aggregated by convolutional layers,providing a more efficient and accurate decoding strategy.In the experiments,we evaluated the performance of the XZZX code under different biased noise conditions(bias=1,20,200)and different code distances(d=3,5,7,9,11).The experimental results show that under low bias noise(bias=1),the GNN decoder achieves a threshold of 0.18386,an improvement of approximately 19.12%compared to the MWPM decoder.Under high bias noise(bias=200),the GNN decoder reaches a threshold of 0.40542,improving by approximately 20.76%,overcoming the limitations of the conventional decoder.They demonstrate that the GNN decoding method exhibits superior performance and has broad application potential in the error correction of XZZX code.展开更多
In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the e...In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.展开更多
An irregular segmented region coding algorithm based on pulse coupled neural network(PCNN) is presented. PCNN has the property of pulse-coupled and changeable threshold, through which these adjacent pixels with approx...An irregular segmented region coding algorithm based on pulse coupled neural network(PCNN) is presented. PCNN has the property of pulse-coupled and changeable threshold, through which these adjacent pixels with approximate gray values can be activated simultaneously. One can draw a conclusion that PCNN has the advantage of realizing the regional segmentation, and the details of original image can be achieved by the parameter adjustment of segmented images, and at the same time, the trivial segmented regions can be avoided. For the better approximation of irregular segmented regions, the Gram-Schmidt method, by which a group of orthonormal basis functions is constructed from a group of linear independent initial base functions, is adopted. Because of the orthonormal reconstructing method, the quality of reconstructed image can be greatly improved and the progressive image transmission will also be possible.展开更多
This paper presents a scheme for improving encoding time for fractal image compression. The approachcombines feature extraction with domain classification using a selforganizing neural network. Feature extractionreduc...This paper presents a scheme for improving encoding time for fractal image compression. The approachcombines feature extraction with domain classification using a selforganizing neural network. Feature extractionreduces the dimensionalics of the problem and enables the neural network to be trained on an image separate fromthe test image. The seaorganizing network introduces a neighborhood topology for classytcation, and alsoeliminates the need to specify a prior set of appropriate image classes. The network organizes itself according to thedistribution of the image features observed during the training. The paper presents results showing that thisclassification approach can reduce encoding time by two orders of magnitude while maintaining comparableaccuracy and compression performance.展开更多
We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding ...We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.展开更多
基金supported by the Natural Science Foundation of Shandong Province,China(Grant No.ZR2021MF049)the Joint Fund of Natural Science Foundation of Shandong Province,China(Grant Nos.ZR2022LL.Z012 and ZR2021LLZ001)the Key Research and Development Program of Shandong Province,China(Grant No.2023CXGC010901).
文摘Quantum error correction is a technique that enhances a system’s ability to combat noise by encoding logical information into additional quantum bits,which plays a key role in building practical quantum computers.The XZZX surface code,with only one stabilizer generator on each face,demonstrates significant application potential under biased noise.However,the existing minimum weight perfect matching(MWPM)algorithm has high computational complexity and lacks flexibility in large-scale systems.Therefore,this paper proposes a decoding method that combines graph neural networks(GNN)with multi-classifiers,the syndrome is transformed into an undirected graph,and the features are aggregated by convolutional layers,providing a more efficient and accurate decoding strategy.In the experiments,we evaluated the performance of the XZZX code under different biased noise conditions(bias=1,20,200)and different code distances(d=3,5,7,9,11).The experimental results show that under low bias noise(bias=1),the GNN decoder achieves a threshold of 0.18386,an improvement of approximately 19.12%compared to the MWPM decoder.Under high bias noise(bias=200),the GNN decoder reaches a threshold of 0.40542,improving by approximately 20.76%,overcoming the limitations of the conventional decoder.They demonstrate that the GNN decoding method exhibits superior performance and has broad application potential in the error correction of XZZX code.
文摘In this paper,a sparse graph neural network-aided(SGNN-aided)decoder is proposed for improving the decoding performance of polar codes under bursty interference.Firstly,a sparse factor graph is constructed using the encoding characteristic to achieve high-throughput polar decoding.To further improve the decoding performance,a residual gated bipartite graph neural network is designed for updating embedding vectors of heterogeneous nodes based on a bidirectional message passing neural network.This framework exploits gated recurrent units and residual blocks to address the gradient disappearance in deep graph recurrent neural networks.Finally,predictions are generated by feeding the embedding vectors into a readout module.Simulation results show that the proposed decoder is more robust than the existing ones in the presence of bursty interference and exhibits high universality.
基金National Natural Science Foundation of China(60572011) 985 Special Study Project(LZ85 -231 -582627)
文摘An irregular segmented region coding algorithm based on pulse coupled neural network(PCNN) is presented. PCNN has the property of pulse-coupled and changeable threshold, through which these adjacent pixels with approximate gray values can be activated simultaneously. One can draw a conclusion that PCNN has the advantage of realizing the regional segmentation, and the details of original image can be achieved by the parameter adjustment of segmented images, and at the same time, the trivial segmented regions can be avoided. For the better approximation of irregular segmented regions, the Gram-Schmidt method, by which a group of orthonormal basis functions is constructed from a group of linear independent initial base functions, is adopted. Because of the orthonormal reconstructing method, the quality of reconstructed image can be greatly improved and the progressive image transmission will also be possible.
文摘This paper presents a scheme for improving encoding time for fractal image compression. The approachcombines feature extraction with domain classification using a selforganizing neural network. Feature extractionreduces the dimensionalics of the problem and enables the neural network to be trained on an image separate fromthe test image. The seaorganizing network introduces a neighborhood topology for classytcation, and alsoeliminates the need to specify a prior set of appropriate image classes. The network organizes itself according to thedistribution of the image features observed during the training. The paper presents results showing that thisclassification approach can reduce encoding time by two orders of magnitude while maintaining comparableaccuracy and compression performance.
文摘We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.
