ITSoc Student Branch Chapters
A Technical Chapter at your is your local link to the valuable resources available from Â鶹´«Ã½AV and its many Societies and Councils. There must be a current, active Student Branch at your school, in order to form a Student Branch Technical Chapter.
Codeword Stabilized Codes from m-Uniform Graph States
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical n,k,d≥m+1 binary linear code with certain additional properties, we show that pure [n,k,m+1]]2 quantum error-correcting codes (QECCs) can be constructed within the codeword stabilized (CWS) code framework. As illustrations, we construct pure [[22r-1,22r-2r-3,3]]2 and [[(24r-1)2,(24r-1)2-32r-7,5]]2 QECCs.
Tailoring Fault-Tolerance to Quantum Algorithms
The standard approach to universal fault-tolerant quantum computing is to develop a general purpose quantum error correction mechanism that can implement a universal set of logical gates fault-tolerantly. Given such a scheme, any quantum algorithm can be realized fault-tolerantly by composing the relevant logical gates from this set. However, we know that quantum computers provide a significant quantum advantage only for specific quantum algorithms.
Shadow Area and Degrees of Freedom for Free-Space Communication
The number of degrees of freedom (NDoF) in a communication channel fundamentally limits the number of independent spatial modes available for transmitting and receiving information. Although the NDoF can be computed numerically for specific configurations using singular value decomposition (SVD) of the channel operator, this approach provides limited physical insight. In this paper, we introduce a simple analytical estimate for the NDoF between arbitrarily shaped transmitter and receiver regions in free space.
Achievable Rates and Error Probability Bounds of Frequency-Based Channels of Unlimited Input Resolution
We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool. Motivated by recent DNA storage techniques, we focus on the regime in which the input resolution is unlimited.