Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Research in Optical Sciences

Optimal Binary Codes and Measurements for Classical Communication over Qubit Channels

Nicola Dalla Pozza, Nicola Laurenti, Francesco Ticozzi

Published Jan 1, 2012• 0 citations
Publisher

Abstract

Developing a suitable geometric representation, we provide algorithmic solutions to the problem of finding pairs of states and measurements that optimize either error probability or mutual information for a given arbitrary qubit channel.
DOI
10.1364/hilas.2012.jt2a.17

Related papers

Optimal Binary Codes and Measurements for Classical Communication over Qubit Channels

Pozza, Nicola Dalla, Nicola Laurenti, Francesco Ticozzi

We propose constructive approaches for the optimization of binary classical communication over a general noisy qubit quantum channel, for both the error probability and the classical capacity functionals. After showing that the optimal measurements are always associated to orthogonal projections, we construct a parametrization of the achievable transition probabilities via the coherence vector representation. We are then able to rewrite the problem in a form that can be solved by standard, efficient numerical algorithms and provides insights on the form of the solutions.

arXiv:1307.0014•Jun 28, 2013•0 citations

Optimal 2N qubit entangled channels for quantum communication

Sreraman Muralidharan, Siddharth Karumanchi, Prasanta Kumar Panigrahi

arXiv:0804.4206•Apr 26, 2008•0 citations

Agreeing over quantum hybrid networks: Centralized and distributed solutions

Guodong Shi, Bo Li, Zibo Miao +2 more

Quantum hybrid networks where classical and quantum components coexist play a fundamental role in quantum communications. We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. We show how to carry out centralized optimal path planning for the network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.

Australian Control Conference•Nov 1, 2016•1 citation

Optimal quantum channel estimation of two interacting qubits subject to decoherence

Qiang Zheng, Yao Yao, Yong Li

The European Physical Journal D•Jun 1, 2014•28 citations

An Experimental Study on Optimization in Permutation Spaces by Quantum-Inspired Evolutionary Algorithm Using Quantum Bit Representation

Yoshifumi Moriyama, Ichiro Iimura, Tomotsugu Ohno +1 more

The quantum-inspired evolutionary algorithm (QEA) and QEA with a pair-swap strategy (QEAPS), where each gene is represented by a quantum bit (qubit) in both algorithms, have shown superior search performance to the classical genetic algorithm in the 0-1 knapsack problem. Also, from experimental results for the integer knapsack problem, a novel integer-type gene-coding method that can obtain an integer value as an observation result by assigning multiple qubits in a gene locus has shown superior search performance to the conventional binary-type gene-coding method. However, the integer-type gene-coding method cannot deal with permutations simply. Therefore, we have proposed two interpretation methods that can deal with permutations in order to expand the gene-coding method based on the qubit representation. From the results of a computer experiment using the proposed interpretation methods in the traveling salesman problem, we have clarified that the two proposed interpretation methods can search for the optimal solution, even with the gene-coding method based on the qubit representation. Moreover, there are suitable rotation angles for discovering the optimal solution that depend on the algorithm.

Journal of Signal Processing•Jan 1, 2015•4 citations

Optimal qubit mapping search for encoding classical data into matrix product state representation with minimal loss

Hyeongjun Jeon, Kyungmin Lee, Dongkyu Lee +2 more

arXiv:2406.06935•Physics Letters A•Jun 7, 2024•2 citations
We propose constructive approaches for the optimization of binary classical communication over a general noisy qubit quantum channel, for both the error probability and the classical capacity functionals. After showing that the optimal measurements are always associated to orthogonal projections, we construct a parametrization of the achievable transition probabilities via the coherence vector representation. We are then able to rewrite the problem in a form that can be solved by standard, efficient numerical algorithms and provides insights on the form of the solutions.
Quantum hybrid networks where classical and quantum components coexist play a fundamental role in quantum communications. We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. We show how to carry out centralized optimal path planning for the network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.
The quantum-inspired evolutionary algorithm (QEA) and QEA with a pair-swap strategy (QEAPS), where each gene is represented by a quantum bit (qubit) in both algorithms, have shown superior search performance to the classical genetic algorithm in the 0-1 knapsack problem. Also, from experimental results for the integer knapsack problem, a novel integer-type gene-coding method that can obtain an integer value as an observation result by assigning multiple qubits in a gene locus has shown superior search performance to the conventional binary-type gene-coding method. However, the integer-type gene-coding method cannot deal with permutations simply. Therefore, we have proposed two interpretation methods that can deal with permutations in order to expand the gene-coding method based on the qubit representation. From the results of a computer experiment using the proposed interpretation methods in the traveling salesman problem, we have clarified that the two proposed interpretation methods can search for the optimal solution, even with the gene-coding method based on the qubit representation. Moreover, there are suitable rotation angles for discovering the optimal solution that depend on the algorithm.