Searcharxiv⌕ Search

arXiv subjects

Lóránt Farkas

Publications and source records attributed to Lóránt Farkas.

10 recordsLinked to original sources
arXiv2026

Independent stabilizer Rényi entropy and entanglement fluctuations in random unitary circuits

We investigate numerically the joint distribution of magic ($M$) and entanglement ($S$) in $N$-qubit Haar-random quantum states. The distribution $P_N(M,S)$ as well as the marginals become exponentially localized, and centered around the values $\tilde{M_2} \to N-2$ and $\tilde{S} \to N/2$ as $N\to\infty$. Magic and entanglement fluctuations are, however, found to become exponentially uncorrelated. Although exponentially many states with magic $M_2=0$ and entropy $S\approx S_\text{Haar}$ exist, they represent an exponentially small fraction compared to typical quantum states, which are characterized by large magic and entanglement entropy, and uncorrelated magic and entanglement fluctuations.

quant-ph↗
arXiv2025

Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits

We study the emergence of complexity in deep random $N$-qubit $T$-gate doped Clifford circuits, as reflected in their spectral properties and in magic generation, characterized by the stabilizer Rényi entropy distribution and the non-stabilizing power of the circuit. For pure (undoped) Clifford circuits, a unique periodic orbit structure in the space of Pauli strings implies peculiar spectral correlations and level statistics with large degeneracies. $T$-gate doping induces an exponentially fast transition to chaotic behavior, described by random matrix theory. We compare these complexity indicators with magic generation properties of the Clifford+$T$ ensemble, and determine the distribution of magic, as well as the average non-stabilizing power of the quantum circuit ensemble. In the dilute limit, $N_T \ll N$, magic generation is governed by single-qubit behavior. Magic is generated in approximate quanta, increases approximately linearly with the number of $T$-gates, $N_T$, and displays a discrete distribution for small $N_T$. At $N_T\approx N$, the distribution becomes quasi-continuous, and for $N_T\gg N$ it converges to that of Haar-random unitaries, and averages to a finite magic density, $m_2$, $\lim_{N\to\infty} \langle m_2 \rangle_\text{Haar} = 1$. This is in contrast to the spectral transition, where ${\cal O} (1)$ $T$-gates suffice to remove spectral degeneracies and to induce a transition to chaotic behavior in the thermodynamic limit. Magic is therefore a more sensitive indicator of complexity.

quant-ph↗
arXiv2024

Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state

In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish a parameter-dependent family of quantum-aided weak broadcast protocols. We compute upper bounds on the failure probability of the protocol, and define and illustrate a procedure that minimizes the quantum resource requirements. Following earlier work demonstrating the suitability of noisy intermediate scale quantum (NISQ) devices for the study of quantum networks, we experimentally create our resource quantum state on publicly available quantum computers. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.

quant-ph↗
arXiv2020

Error Exponents for Asynchronous Multiple Access Channels. Controlled Asynchronism may Outperform Synchronism

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of types. Maximum empirical multi-information decoding is employed. A key tool is an improved packing lemma, that overcomes the technical difficulty caused by codeword repetitions, via an induction based new argument. The asymptotic form of the bounds admits numerical evaluation. This demostrates that error exponents achievable by synchronous transmission (if possible) can be superseeded via controlled asynchronism, i.e. a deliberate shift of the codewords.

cs.IT↗
arXiv2017

Universal Random Access Error Exponents for Codebooks of Different Word-Lengths

Csiszár's channel coding theorem for multiple codebooks is generalized allowing the codeword lenghts differ across codebooks. Also in this case, for each codebook an error exponent can be achieved that equals the random coding exponent for this codebook alone, in addition, erasure detection failure probability tends to 0. This is proved even for sender and receiver not knowing the channel. As a corollary, a substantial improvement is obtained when the sender knows the channel.

cs.IT↗
arXiv2014

Building Block Components to Control a Data Rate in the Apache Hadoop Compute Platform

Resource management is one of the most indispensable components of cluster-level infrastructure layers. Users of such systems should be able to specify their job requirements as a configuration parameter (CPU, RAM, disk I/O, network I/O) and have the scheduler translate those into an appropriate reservation and allocation of resources. YARN is an emerging resource management in the Hadoop ecosystem, which supports only RAM and CPU reservation at present. In this paper, we propose a solution that takes into account the operation of the Hadoop Distributed File System to control the data rate of applications in the framework of a Hadoop compute platform. We utilize the property that a data pipe between a container and a DataNode consists of a disk I/O subpipe and a TCP/IP subpipe. We have implemented building block software components to control the data rate of data pipes between containers and DataNodes and provide a proof-of-concept with measurement results.

cs.DC↗
arXiv2014

On Capacity Regions of Discrete Asynchronous Multiple Access Channels

A general formalization is given for asynchronous multiple access channels which admits different assumptions on delays. This general framework allows the analysis of so far unexplored models leading to new interesting capacity regions. In particular, a single letter characterization is given for the capacity region in case of 3 senders, 2 synchronous with each other and the third not synchronous with them.

cs.IT↗
arXiv2013

Random Access and Source-Channel Coding Error Exponents for Multiple Access Channels

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the case of independent sources. This exponent is improved in a modified model that admits error free 0 rate communication between the senders.

cs.IT↗