dorsal/arxiv
View SchemaCreating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code
| Authors | Jin-Yuan Hsieh, Che-Ming Li |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0405038 |
| URL | https://arxiv.org/abs/quant-ph/0405038 |
Abstract
A quantum single-error-correcting scheme can be derived from a one-way entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of such an error-correction is to create specific linear Boolean functions that can transform the sixteen error syndromes occurring in the error-correcting code onto their mappings so that one Bell state is corrected whenever the other four in the finite block are measured. The Boolean function is performed under the effect of its associated sequence of basic quantum unilateral and bilateral operations. Previously, the Boolean function is created in use of the Monte Carlo computer search method. We introduce here a systematic scenario for creating the Boolean function and its associated sequence of operations so that we can do the job in an analytical way without any trial and error effort. Consequently, all possible Boolean functions can in principle be created by using our method. Furthermore, for a deduced Boolean function, we can also in the spirit of our method derive its best associated sequence of operations which may contain the least number of total operations or the least number of the bilateral XOR operations alone. Some results obtained in this work show the capability of our method in creating the Boolean function and its sequence of operations.
{
"annotation_id": "7bcc18b7-3e05-4749-9ed6-611454bcfb7e",
"date_created": "2026-03-02T18:02:06.876000Z",
"date_modified": "2026-03-02T18:02:06.876000Z",
"file_hash": "8e1c2b3b5f8eb8daab15506637d28f8eb509ffd141ba6a6b3480ff202511f8db",
"private": false,
"record": {
"abstract": "A quantum single-error-correcting scheme can be derived from a one-way\nentanglement purification protocol in purifying one Bell state from a finite\nblock of five Bell states. The main issue to be concerned with in the theory of\nsuch an error-correction is to create specific linear Boolean functions that\ncan transform the sixteen error syndromes occurring in the error-correcting\ncode onto their mappings so that one Bell state is corrected whenever the other\nfour in the finite block are measured. The Boolean function is performed under\nthe effect of its associated sequence of basic quantum unilateral and bilateral\noperations. Previously, the Boolean function is created in use of the Monte\nCarlo computer search method. We introduce here a systematic scenario for\ncreating the Boolean function and its associated sequence of operations so that\nwe can do the job in an analytical way without any trial and error effort.\nConsequently, all possible Boolean functions can in principle be created by\nusing our method. Furthermore, for a deduced Boolean function, we can also in\nthe spirit of our method derive its best associated sequence of operations\nwhich may contain the least number of total operations or the least number of\nthe bilateral XOR operations alone. Some results obtained in this work show the\ncapability of our method in creating the Boolean function and its sequence of\noperations.",
"arxiv_id": "quant-ph/0405038",
"authors": [
"Jin-Yuan Hsieh",
"Che-Ming Li"
],
"categories": [
"quant-ph"
],
"title": "Creating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code",
"url": "https://arxiv.org/abs/quant-ph/0405038"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "35b62eb3-0e81-4563-9094-27098db55aad",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}