1 citations · 1 across the 11 of their papers we have counts for
10 papers · 1 filter
Codes for Quantum Secret Sharing with a Helper
Eric Chitambar, Sarah Hagen, David W. Kribs +3
Helper quantum secret sharing is a form of secret sharing defined by its unique access structure. One special fixed party, called the helper, can work together with any other party…
Quantum Secret Sharing with a Helper and Programmable Access Structures
Eric Chitambar, Sarah Hagen, David W. Kribs +2
Quantum secret sharing (QSS) is a process in which the state of a quantum system is partitioned into multiple shares, allowing only specific subsets of shareholders to reconstruct…
Computationally Efficient Optimization of Per-Qubit Clifford Deformation for Non-uniform Biased Noise
Won Joon Yun, Andrew Nemec, Jonathan M. Baker
In fault-tolerant quantum computing systems with biased noise, Clifford deformation can substantially reduce the logical error rate (LER) without additional physical hardware overh…
Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory
Jonas Eidesen, David W. Kribs, Andrew Nemec
Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of…
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
Varin Sikand, Andrew Nemec
Quantum secret sharing schemes are a family of quantum cryptographic protocols which provide secure quantum encodings, mapping one secret to multiple shares of information such tha…
Entanglement-Assisted Codes Outside the Stabilizer Framework
Jaszmine DeFranco, Andrew Nemec
We show how entanglement-assisted codes can be constructed from arbitrary quantum codes by associating them with quantum codes for erasure channels. If a subset of physical qubits…
BiBiEQ: Bivariate Bicycle Codes on Erasure Qubits
Ameya S. Bhave, Navnil Choudhury, Andrew Nemec +1
Erasure qubits reduce overhead in fault-tolerant quantum error correction (QEC) by converting dominant faults into detectable errors known as erasures. They have demonstrated notab…
Structure Theorem for Quantum Replacer Codes
Eric Chitambar, Sarah Hagen, David W. Kribs +2
Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the era…
SDP bounds on quantum codes
Gerard Anglès Munné, Andrew Nemec, Felix Huber
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is…
Robust Syndrome Extraction via BCH Encoding
Eren Guttentag, Andrew Nemec, Kenneth R. Brown
Quantum data-syndrome (QDS) codes are a class of quantum error-correcting codes that protect against errors both on the data qubits and on the syndrome itself via redundant measure…