5 citations · 6 across the 6 of their papers we have counts for
8 papers
The Find Rows and Columns and Decode algorithm for quantum expander codes
Dimiter Ostrev
A new adaptation of the Find Erasures and Decode algorithm from classical to quantum expander codes is presented. It runs in linear time and is parallelizable to logarithmic depth.…
Canonical Form and Finite Blocklength Bounds for Stabilizer Codes
Dimiter Ostrev
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group…
Quantum LDPC codes from intersecting subsets
Dimiter Ostrev
This paper introduces a construction of quantum CSS codes from a tuple of component CSS codes and two collections of subsets. The resulting codes have parallelizable encoding and s…
Classical product code constructions for quantum Calderbank-Shor-Steane codes
Dimiter Ostrev, Davide Orsucci, Francisco Lázaro +1
Several notions of code products are known in quantum error correction, such as hyper-graph products, homological products, lifted products, balanced products, to name a few. In th…
QKD parameter estimation by two-universal hashing
Dimiter Ostrev
This paper proposes and proves security of a QKD protocol which uses two-universal hashing instead of random sampling to estimate the number of bit flip and phase flip errors. This…
Composable, Unconditionally Secure Message Authentication without any Secret Key
Dimiter Ostrev
We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error cor…
Entanglement of approximate quantum strategies in XOR games
Dimiter Ostrev, Thomas Vidick
We show that for any there is an XOR game with inputs for one player and inputs for the other pla…
The structure of optimal and nearly-optimal quantum strategies for non-local XOR games
Dimiter Ostrev
We study optimal and nearly-optimal quantum strategies for non-local XOR games. First, we prove the following general result: for every non-local XOR game, there exists a set of re…