检索结果-内蒙古大学图书馆

quantum coding in non-inertial frames

quantum INFORMATION PROCESSING 2014年第3期13卷 771-780页

作者： Metwally, Nasser Sagheer, Alaa Aswan Univ Dept Math Fac Sci Aswan Egypt Univ Bahrain Dept Math Coll Sci Sakhir Bahrain Ctr Artificial Intelligence & Robot CAIRO Dept Math Aswan Egypt

The quantum and classical correlations are quantified by means of the coherent and mutual information, respectively, where we use the single-mode approximation. It is shown that the users can communicate in an optimal way for small values of accelerations. The capacity of accelerated channel is investigated for different classes of initial states. It is shown that the capacities of the traveling channels depend on the frame in which the accelerated channels are observed in and the initial shared state between the partners. In some frames, the capacities decay as the accelerations of both qubit increase. The decay rate is larger if the partners initially share a maximum entangled state. The possibility of using the accelerated quantum channels to perform quantum coding protocol is discussed. The amount of decoded information is quantified for different cases, where it decays as the partner's accelerations increase to reach its minimum bound. This minimum bound depends on the initial shared states, and it is large for maximum entangled state.

关键词： quantum coding Non-inertial frames Capacity

来源：评论

学校读者我要写书评

暂无评论

Image encryption scheme by combining the hyper-chaotic system with quantum coding

引用

OPTICS AND LASERS IN ENGINEERING 2020年 124卷 105836-000页

作者： Luo, Yuling Tang, Shunbin Liu, Junxiu Cao, Lvchen Qiu, Senhui Guangxi Normal Univ Sch Elect Engn Guilin 541004 Peoples R China

The application of quantum mechanisms in image processing has attracted wide attention. In this paper, an image encryption scheme that is based on hyper-chaos and quantum coding is proposed. First, based on a novel enhanced quantum representation (NEQR), the bit-level adjacent-exchange operation is implemented to pre-process the plain-image, which has lower computational complexity compared to conventional bit-level switching operations. Then, the processed image is diffused by the quantified sequences where the self-adapting parameters are applied to quantify the sequences that are generated by Chen's hyper-chaotic system. In addition, inspired by the quantum coding structure, a novel scrambling method that is based on quantum location coding is proposed. This method is used to further scramble the diffused image to obtain the final cipher-image. The experimental results and performance analysis demonstrate that the proposed image encryption scheme has high security performance.

关键词： Image processing quantum coding Bit-level NEQR Chen's hyper-chaotic system

来源：评论

学校读者我要写书评

暂无评论

Asymptotic redundancies for universal quantum coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第3期46卷 801-819页

作者： Krattenthaler, C Slater, PB Univ Vienna Inst Math A-1090 Vienna Austria Univ Calif Santa Barbara Inst Social Behav & Econ Res Santa Barbara CA 93106 USA

Clarke and Barren have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analog of this result for the two-level quantum systems, We restrict our considerations to prior probability distributions belonging to a certain one-parameter family, q(u), - infinity < u < 1, Within this setting, we are able to compute exact redundancy formulas, for which we find the asymptotic limits. We compare our quantum asymptotic redundancy formulas to those derived by naively applying the (nonquantum) counterparts of Clarke and Barren, and find certain common features, Our results are based on formulas we obtain for the eigenvalues and eigenvectors of 2(n) x 2(n) (Bayesian density) matrices, zeta(n)(u), These matrices are the weighted averages (with respect to q(u)) of all possible tensor products of n identical 2 x 2 density matrices, representing the two-level quantum systems, We propose a form of universal coding for the situation in which the density matrix describing an ensemble of quantum signal states is unknown, A sequence of n signals would be projected onto the dominant eigenspaces of zeta(n)(u).

关键词： asymptotic redundancy ballot paths Bayes codes Bayesian density matrices Bayes redundancy Dyck paths Jeffreys' prior Kubo-Mori/Bogoliubov metric monotone metric quantum coding quantum information theory relative entropy Schumacher compression symmetric logarithmic derivative two-level quantum systems universal data compression

来源：评论

学校读者我要写书评

暂无评论

Robust quantum coding for thermal noise via dissipative dynamics 62

Robust quantum coding for thermal noise via dissipative dyna...

引用

62nd IEEE Conference on Decision and Control (CDC)

作者： Nishino, Kazuki Ohki, Kentaro Tsumura, Koji Univ Tokyo Dept Informat Phys & Comp Tokyo Japan Kyoto Univ Dept Appl Math & Phys Kyoto Japan

ISBN: (纸本)9798350301243

This paper proposes an improved quantum coding method based on Markovian dissipative dynamics that is robust against thermal noise. A method for correcting information errors is indispensable for the practical use of quantum information devices, and stabilizer codes for quantum systems have been devised. One of the quantum coding methods, namely, quantum coding based on Markovian dissipative dynamics, has a favorable feature that it does not require strict time control, however it is known that these methods are susceptible to thermal noise. In this paper, we propose a quantum coding method that incorporates a new mechanism to correct the disturbance of the quantum state caused by thermal noise into the quantum coding method using dissipative dynamics. We also analyze the stability of the proposed quantum dynamics in the quantum state corresponding to the target code word. Numerical experiments confirm the effectiveness of the proposed method.

关键词： quantum coding dissipative dynamics and thermal noise

来源：评论

学校读者我要写书评

暂无评论

Distribution Network Reconstruction Based on Discrete Particle Swarm Algorithm Based on quantum coding

Distribution Network Reconstruction Based on Discrete Partic...

引用

2024 International Conference on Optimization Computing and Wireless Communication, ICOCWC 2024

作者： Luo, Ning Chen, Ludong Liu, Jinsen Zhang, Pengcheng Zheng, Fei Power Grid Planning and Research Center of Guizhou Power Grid Co. Ltd. Guizhou Guiyang China

ISBN: (纸本)9798350383348

quantum-coded discrete particle swarm optimization (QBPSO) is a new optimization method which combines quantum computation principle and traditional particle swarm optimization (PSO) algorithm. By introducing the probabilistic representation of qubits, the algorithm improves the population diversity and enhances the global search ability. In the distribution network reconfiguration problem, the algorithm can be used to find the optimal structure of the network in order to reduce the loss, balance the load, improve the reliability of power supply and so on. © 2024 IEEE.

关键词： current overload theory discrete particle swarm algorithm Distribution network reconstruction quantum coding smart grid

来源：评论

学校读者我要写书评

暂无评论

A quantum analog of Huffman coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第4期46卷 1644-1649页

作者： Braunstein, SL Fuchs, CA Gottesman, D Lo, HK Univ Wales SEECS Bangor LL57 1UT Gwynedd Wales Hewlett Packard Labs Bristol BS34 8QZ Avon England CALTECH Norman Bridge Lab Phys 12 33 Pasadena CA 91125 USA Univ Calif Los Alamos Natl Lab Los Alamos NM 87545 USA MagiQ Technol Inc New York NY 10001 USA

We analyze a generalization of Huffman coding to the quantum ease. In particular, Re notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman-coding-inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be of polylogarithmic depth by a massively parallel implementation of a quantum gate array. This is to be compared with the O(N-8) computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block-coding scheme of Schumacher. We also show that O(N-2(log N)(a)) sequential computational steps are needed for the communication of quantum information using another Huffman-coding-inspired scheme where the sender must disentangle her encoding device before the receiver can perform any measurements on his signals.

关键词： data compression Huffman coding instantaneous codes quantum coding quantum information variable-length codes

来源：评论

学校读者我要写书评

暂无评论

A novel lottery protocol based on quantum blockchain

引用

quantum INFORMATION PROCESSING 2025年第2期24卷 1-24页

作者： Yang, Yu-Guang Qiu, Shi Wang, Yue-Chao Xu, Guang-Bao Jiang, Dong-Huan Beijing Univ Technol Coll Comp Sci & Technol Beijing 100124 Peoples R China Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Peoples R China Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Peoples R China

The lottery business is a form of gambling activity operated by authority agencies. Due to the substantial economic interests, its security and fairness become the core elements of industry development. To maintain the trust of participants and ensure fair competition, blockchain technology has been widely applied in the lottery field due to the characteristics of decentralization, transparency, and immutability. However, with the rapid advancement of quantum computing, the security of traditional blockchain technology is challenged largely. To tackle this issue, a novel consensus mechanism which can resist quantum attacks is first proposed, based on a self-tallying quantum voting protocol. Then, a quantum circuit is designed, which can encode n-bit binary information into the relative phase of a quantum state and entangle the blocks by means of controlled-Z (CZ) gate, forming a quantum blockchain structure with timestamps. Finally, utilizing the designed quantum blockchain, a new type of lottery protocol is constructed. The proposed protocol meets the requirements of decentralization, unforgeability, verifiability, and quantum attack resistance. Compared to existing lottery protocols, it can support an arbitrary number of players, and only one communication is required for the ticket purchase process of each player, making it suitable for most of lottery game scenarios.

关键词： Consensus algorithm quantum blockchain quantum coding Lottery protocol

来源：评论

学校读者我要写书评

暂无评论

Stability on the Robust Dissipative coding in quantum System for Thermal Noise 26

Stability on the Robust Dissipative Coding in Quantum System...

引用

26th International Symposium on Mathematical Theory of Networks and Systems (MTNS)

作者： Supithak, Tanathorn Tsumura, Koji Univ Tokyo Dept Informat Phys & Comp Tokyo 1138654 Japan Reitaku Univ Fac Engn Chiba 2770065 Japan

In this paper, we deal with the stability of the improved quantum coding method based on Markovian dissipative dynamics that is robust against thermal noise. This coding method was proposed by Nishino et al. and the suppression of the effect of thermal noise was demonstrated by numerical simulations, however the mathematical proof was not given. In this paper, we analyze the impact of the thermal noise in this method and mathematically prove that the quantum states converge to a neighborhood around the target code words. The bound of the neighborhood set is also given strictly. We also demonstrate numerical simulations, which confirm the theoretical results. Copyright (c) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)

关键词： quantum coding dissipative dynamics quantum dynamics Lyapunov stability thermal noise

来源：评论

学校读者我要写书评

暂无评论

Stability on the Robust Dissipative coding in quantum System for Thermal Noise

引用

IFAC-PapersOnLine 2024年第17期58卷 427-432页

作者： Tanathorn Supithak Koji Tsumura

关键词： quantum coding dissipative dynamics quantum dynamics Lyapunov stability thermal noise AMS subject classifications: 81P70 82C10 93D05

来源：评论

学校读者我要写书评

暂无评论

On quantum fidelities and channel capacities

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第4期46卷 1317-1329页

作者： Barnum, H Knill, E Nielsen, MA Univ Bristol Dept Comp Sci Bristol BS8 1UB Avon England Los Alamos Natl Lab Los Alamos NM 87545 USA Univ Queensland Dept Phys Brisbane Qld 4072 Australia

For the discrete memoryless quantum channel, me show the equivalence of two different notions of quantum channel capacity: that which uses the entanglement fidelity as its criterion for success in transmission, and that which uses the minimum fidelity of pure states in a subspace of the input Hilbert space as its criterion. As a corollary, arty source with entropy rate less than the capacity may be transmitted with high entanglement fidelity. We also show that a restricted class of encodings is sufficient to transmit any quantum source which may be transmitted on a given channel. This enables us to simplify a known upper bound for the channel capacity It also enables us to show that the availability of an auxiliary classical channel from encoder to decoder does not increase the quantum capacity.

关键词： channel capacity entanglement quantum channels quantum coding quantum fidelity quantum information

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：