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

Electronic colloquium on computational complexity

Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$).

Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena

Published Jan 1, 2021• 0 citations
OpenAlex

Related papers

Bell's Theorem Without Inequalities.

Hyung Sup Choi

•Jan 1, 1991•0 citations

Efficient Interactive Coding Achieving Optimal Error Resilience over the Binary Channel

Meghal Gupta, Rachel Zhang

Given a noiseless protocol π0 computing a function f(x, y) of Alice and Bob’s private inputs x, y, the goal of interactive coding is to construct an error-resilient protocol π computing f such that even if some fraction of the communication is adversarially corrupted, both parties still learn f(x, y). Ideally, the resulting scheme π should be positive rate, computationally efficient, and achieve optimal error resilience.

arXiv:2207.01144•ACM Symposium on Theory of Computing (STOC)•May 16, 2023•6 citations

Protocol for generation of high-dimensional entanglement from an array of non-interacting photon emitters

Thomas J Bell, Jacob F. F. Bulmer, Alex E. Jones +3 more

Abstract Encoding high-dimensional quantum information into single photons can provide a variety of benefits for quantum technologies, such as improved noise resilience. However, the efficient generation of on-demand, high-dimensional entanglement was thought to be out of reach for current and near-future photonic quantum technologies. We present a protocol for the near-deterministic generation of N-photon, d-dimensional photonic Greenberger–Horne–Zeilinger (GHZ) states using an array of d non-interacting single-photon emitters. We analyse the impact on performance of common sources of error for quantum emitters, such as photon spectral distinguishability and temporal mismatch, and find they are readily correctable with time-resolved detection to yield high fidelity GHZ states of multiple qudits. When applied to a quantum key distribution scenario, our protocol exhibits improved loss tolerance and key rates when increasing the dimensionality beyond binary encodings.

arXiv:2201.01179•New Journal of Physics•Dec 31, 2021•17 citations

Bell's inequality without alternative settings

Adán Cabello

arXiv:quant-ph/0210081•Physics Letters A•May 19, 2003•6 citations

About a Generalization of Bell's Inequality

V. M. González-Robles

Foundations of Physics•May 1, 2003•0 citations

Estimating the Sizes of Binary Error-Correcting Constrained Codes

V. Arvind Rameshwar, Navin Kashyap

In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve vanishing probabilities of error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure channel, constrained subcodes of such linear codes are also resilient to random bit-flip errors and erasures. We employ a simple identity from the Fourier analysis of Boolean functions, which transforms the problem of counting constrained codewords of linear codes to a question about the structure of the dual code. We illustrate the utility of our method in providing explicit values or efficient algorithms for our counting problem, by showing that the Fourier transform of the indicator function of the constraint is computable, for different constraints. Our second approach is to obtain good upper bounds, using an extension of Delsarte's linear program (LP), on the largest sizes of constrained codes that can correct a fixed number of combinatorial errors or erasures. We observe that the numerical values of our LP-based upper bounds beat the generalized sphere packing bounds of Fazeli, Vardy, and Yaakobi (2015).

arXiv:2301.05098•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2023•4 citations
Binary Interactive Error Resilience Beyond 1/81/81/8 (or why (1/2)3>1/8(1/2)^3 > 1/8(1/2)3>1/8).
Abstract Encoding high-dimensional quantum information into single photons can provide a variety of benefits for quantum technologies, such as improved noise resilience. However, the efficient generation of on-demand, high-dimensional entanglement was thought to be out of reach for current and near-future photonic quantum technologies. We present a protocol for the near-deterministic generation of N-photon, d-dimensional photonic Greenberger–Horne–Zeilinger (GHZ) states using an array of d non-interacting single-photon emitters. We analyse the impact on performance of common sources of error for quantum emitters, such as photon spectral distinguishability and temporal mismatch, and find they are readily correctable with time-resolved detection to yield high fidelity GHZ states of multiple qudits. When applied to a quantum key distribution scenario, our protocol exhibits improved loss tolerance and key rates when increasing the dimensionality beyond binary encodings.
In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve vanishing probabilities of error over the binary symmetric channel (which causes bit-flip errors) and the binary erasure channel, constrained subcodes of such linear codes are also resilient to random bit-flip errors and erasures. We employ a simple identity from the Fourier analysis of Boolean functions, which transforms the problem of counting constrained codewords of linear codes to a question about the structure of the dual code. We illustrate the utility of our method in providing explicit values or efficient algorithms for our counting problem, by showing that the Fourier transform of the indicator function of the constraint is computable, for different constraints. Our second approach is to obtain good upper bounds, using an extension of Delsarte's linear program (LP), on the largest sizes of constrained codes that can correct a fixed number of combinatorial errors or erasures. We observe that the numerical values of our LP-based upper bounds beat the generalized sphere packing bounds of Fazeli, Vardy, and Yaakobi (2015).