arXiv subjects

Kamil Bradler

Publications and source records attributed to Kamil Bradler.

At least 19 recordsLinked to original sources

arXiv2026

Efficient and scalable inter-module switching for distributed quantum computing architectures

Large-scale fault-tolerant quantum computers of the future will likely be modular by necessity or by design. Modularity is inevitable if the substrate cannot support the desired error-correction code due to its planar geometry or manufacturing constraints resulting in a limited number of logical qubits per module. Even if the computer is compact enough there may be functional requirements to distribute the quantum computation substrate over distant regions of varying scales. In both cases, matter-based quantum information, such as spins, ions or neutral atoms, is the most conveniently transmitted or mediated by photonic interconnects. To avoid long algorithm execution times and reduce errors, each module of a universal quantum computer should be dynamically interconnected with as many other modules as possible. This task relies on an optical switching network providing any-to-any or sufficiently high simultaneous connectivity. In this work we construct several novel and decentralized switching schemes based on the properties of the Generalized Mach-Zehnder Interferometer (GMZI) that are more economic and less noisy compared to commonly considered alternatives while achieving the same functionality. We show that as the number of logical patches $n$ grows the active optical depth scales as $Θ(\log{n})$ without sacrificing the logical qubit connectivity.

quant-ph↗

arXiv2026

CSS codes from the Bruhat order of Coxeter groups

I introduce a method to generate families of CSS codes with interesting code parameters. The object of study is Coxeter groups, both finite and infinite (reducible or not), and a geometrically motivated partial order of Coxeter group elements named after Bruhat. The Bruhat order is known to provide a link to algebraic topology -- it doubles as a face poset capturing the inclusion relations of the $p$-dimensional cells of a regular CW~complex and that is what makes it interesting for QEC code design. Assisted by the Bruhat face poset interval structure unique to Coxeter groups I show that the corresponding chain complexes can be turned into multitudes of CSS codes. Depending on the approach, I obtain CSS codes (and their families) with controlled stabilizer weights, for example $[6006, 924, \{{\leq14},{\leq7}\}]$ (stabilizer weights~14 and 9) and $[22880,3432,\{{\leq8},{\leq16}\}]$ (weights 16 and 10), and CSS codes with highly irregular stabilizer weight distributions such as $[571,199,\{5,5\}]$. For the latter, I develop a weight-reduction method to deal with rare heavy stabilizers. Finally, I show how to extract four-term (length three) chain complexes that can be interpreted as CSS codes with a metacheck.

quant-ph↗

arXiv2021

Certain properties and applications of shallow bosonic circuits

We introduce a novel approach to solve optimization problems on a boson sampling device assisted by classical machine-learning techniques. By virtue of the parity function, we map all measurement patterns, which label the basis spanning an $M$-mode bosonic Hilbert space, to the Hilbert space of $M$ qubits. As a result, the sampled probability function can be interpreted as a result of sampling a multiqubit circuit. The method is presented on several instances of a QUBO/Ising problem as well as portfolio optimization problems. Among many demonstrated properties of the parity function is the ability to chart the entire qubit Hilbert space no matter how shallow the initial bosonic circuits is. In order to show this we link boson sampling circuits to a class of finite Young's lattices (a special poset with the so-called Ferrers diagrams ordered by inclusion), Boolean lattices and the properties of Dyck/staircase paths on integer lattices. Our results and methods can be applied to a large variety of photonic circuits, including the deep ones of essentially any geometry, but our main focus is on shallow circuits as they are less affected by photon loss and relatively easy to implement in the form of a time-bin interferometer.

quant-ph↗

arXiv2021

Graph isomorphism and Gaussian boson sampling

We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed with photon-number-resolving detectors. We prove that the probabilities of different photon-detection events in this setup can be combined to give a complete set of graph invariants. Two graphs are isomorphic if and only if their detection probabilities are equivalent. We present additional ways that the measurement probabilities can be combined or coarse-grained to make experimental tests more amenable. We benchmark these methods with numerical simulations on the Titan supercomputer for several graph families: pairs of isospectral nonisomorphic graphs, isospectral regular graphs, and strongly regular graphs.

quant-ph↗

arXiv2021

Nonnegativity for hafnians of certain matrices

We show that a complex symmetric matrix of the form $A(Y,B) = \begin{bmatrix}Y & B\\ B^\top & \overline{Y} \end{bmatrix},$ where $B$ is Hermitian positive semidefinite, has a nonnegative hafnian. These are positive scalar multiples of matrices $A(Y,B)$ that are encodable in a Gaussian boson sampler. Further, the hafnian of this matrix is non-decreasing in $B$ in the sense that $\mathrm{haf}A(Y,L) \ge \mathrm{haf}A(Y,B)$ if $L \succeq B$.

quant-ph↗

arXiv2019

A duality at the heart of Gaussian boson sampling

Gaussian boson sampling (GBS) is a near-term quantum computation framework that is believed to be classically intractable, but yet rich of potential applications. In this paper we study the intimate relation between distributions defined over classes of samples from a GBS device with graph matching polynomials. For this purpose, we introduce a new graph polynomial called the displaced GBS polynomial, whose coefficients are the coarse-grained photon-number probabilities of an arbitrary undirected graph $G$ encoded in a GBS device. We report a discovery of a duality between the displaced GBS polynomial of $G$ and the matching polynomial of $G\,\square\,P_2(x)$ - the Cartesian graph product of $G$ with a single weighted edge also known as the prism over $G$. Besides the surprising insight gained into Gaussian boson sampling, it opens the door for the new way of classically simulating the Gaussian boson sampling device. Furthermore, it motivates the recent success of a new type of coarse-grained quantum statistics used to construct feature maps in [Schuld et al. 2019].

quant-ph↗

arXiv2019

Hybrid spatiotemporal architectures for universal linear optics

We present two hybrid linear-optical architectures that simultaneously exploit spatial and temporal degrees of freedom of light to effect arbitrary discrete unitary transformations. Our architectures combine the benefits of spatial implementations of linear optics, namely low loss and parallel operation, with those of temporal implementations, namely modest resource requirements and access to transformations of potentially unbounded size. We arrive at our architectures by devising and employing decompositions of large discrete unitary transformations into smaller ones, decompositions we expect to have broad utility beyond spatio-temporal linear optics. We show that hybrid architectures promise important advantages over both spatial-only and temporal-only architectures.

quant-ph↗

arXiv2018

Unitary evolution of a pair of Unruh-DeWitt detectors calculated efficiently to an arbitrary perturbative order

Unruh-DeWitt Hamiltonian couples a scalar field with a two-level atom serving as a particle detector model. Two such detectors held by different observers following general trajectories can be used to study entanglement behavior in quantum field theory. Lacking other methods, the unitary evolution must be studied perturbatively which is considerably time-consuming even to a low perturbative order. Here we completely solve the problem and present a simple algorithm for a perturbative calculation based on a solution of a system of linear Diophantine equations. The algorithm runs polynomially with the perturbative order. This should be contrasted with the number of perturbative contributions of the scalar phi^4 theory that is known to grow factorially. Speaking of the phi^4 model, a welcome collateral result is obtained to mechanically (almost mindlessly) calculate the interacting scalar phi^n theory without resorting to Feynman diagrams. We demonstrate it on a typical textbook example of two interacting fields for n=3,4.

hep-th↗

arXiv2018

A novel approach to perturbative calculations for a large class of interacting boson theories

We present a method of calculating the interacting S-matrix to an arbitrary perturbative order for a large class of boson interaction Lagrangians. The method takes advantage of a previously unexplored link between the $n$-point Green's function and a certain system of linear Diophantine equations. By finding all nonnegative solutions of the system, the task of perturbatively expanding an interacting $S$-matrix becomes elementary for any number of interacting fields, to an arbitrary perturbative order (irrespective of whether it makes physical sense) and for a large class of scalar boson theories. The method does not rely on the position-based Feynman diagrams and promises to be extended to many perturbative models typically studied in quantum field theory. Aside from interaction field calculations we showcase our approach by expanding a pair of Unruh-DeWitt detectors coupled to Minkowski vacuum to an arbitrary perturbative order in the coupling constant. We also link our result to Hafnian as introduced by Caianiello and present a method to list all (2n-1)!! perfect matchings of a complete graph on 2n vertices.

hep-th↗

arXiv2018

A security proof of continuous-variable QKD using three coherent states

We introduce a ternary quantum key distribution (QKD) protocol and asymptotic security proof based on three coherent states and homodyne detection. Previous work had considered the binary case of two coherent states and here we nontrivially extend this to three. Our motivation is to leverage the practical benefits of both discrete and continuous (Gaussian) encoding schemes creating a best-of-both-worlds approach; namely, the postprocessing of discrete encodings and the hardware benefits of continuous ones. We present a thorough and detailed security proof in the limit of infinite signal states which allows us to lower bound the secret key rate. We calculate this is in the context of collective eavesdropping attacks and reverse reconciliation postprocessing. Finally, we compare the ternary coherent state protocol to other well-known QKD schemes (and fundamental repeaterless limits) in terms of secret key rates and loss.

quant-ph↗

arXiv2017

Covert Quantum Internet

We apply covert quantum communication based on entanglement generated from the Minkowski vacuum to the setting of quantum computation and quantum networks. Our approach hides the generation and distribution of entanglement in quantum networks by taking advantage of relativistic quantum effects. We devise a suite of covert quantum teleportation protocols that utilize the shared entanglement, local operations, and covert classical communication to transfer or process quantum information in stealth. As an application of our covert suite, we construct two prominent examples of measurement-based quantum computation, namely the teleportation-based quantum computer and the one-way quantum computer. In the latter case we explore the covert generation of graph states, and subsequently outline a protocol for the covert implementation of universal blind quantum computation.

quant-ph↗

arXiv2016

On the number of nonnegative solutions of a system of linear Diophantine equations

We derive a closed expression for the number of nonnegative solutions of a certain system of linear Diophantine equations. The motivation comes from high energy physics where the nonnegative solutions play a crucial role in the perturbative calculation for a class of Lagrangians describing the interaction of an atom with a boson field or a non-linear interaction of boson fields among themselves (the so-called interacting phi^n models). The linear system can be solved and the nonnegative solutions enumerated but a closed expression for the number of solutions is preferable to counting the solutions. Interestingly, the problem led to a construction of a simpler linear Diophantine system whose nonnegative number of solutions turns out to be the magic constant.

math-ph↗

arXiv2016

Absolutely covert quantum communication

We present truly ultimate limits on covert quantum communication by exploiting quantum-mechanical properties of the Minkowski vacuum in the quantum field theory framework. Our main results are the following: We show how two parties equipped with Unruh-DeWitt detectors can covertly communicate at large distances without the need of hiding in a thermal background or relying on various technological tricks. We reinstate the information-theoretic security standards for reliability of asymptotic quantum communication and show that the rate of covert communication is strictly positive. Therefore, contrary to the previous conclusions, covert and reliable quantum communication is possible.

quant-ph↗

arXiv2016

Finite-key security analysis for multilevel quantum key distribution

We present a detailed security analysis of a d-dimensional quantum key distribution protocol based on two and three mutually unbiased bases (MUBs) both in an asymptotic and finite key length scenario. The finite secret key rates are calculated as a function of the length of the sifted key by (i) generalizing the uncertainly relation-based insight from BB84 to any d-level 2-MUB QKD protocol and (ii) by adopting recent advances in the second-order asymptotics for finite block length quantum coding (for both d-level 2- and 3-MUB QKD protocols). Since the finite and asymptotic secret key rates increase with d and the number of MUBs (together with the tolerable threshold) such QKD schemes could in principle offer an important advantage over BB84. We discuss the possibility of an experimental realization of the 3-MUB QKD protocol with the orbital angular momentum degrees of freedom of photons.

quant-ph↗

arXiv2015

The pitfalls of deciding whether a quantum channel is (conjugate) degradable and how to avoid them

To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we derive a necessary and sufficient condition to decide under what circumstances the conclusion is unambiguous. The findings lead to an extension of the antidegradability region for qubit and qutrit transpose depolarizing channels. In the qubit case we reproduce the known results for the class of qubit depolarizing channels (due to their equivalence). One of the consequences is that the optimal qubit and qutrit asymmetric cloners possess a single-letter quantum capacity formula. We also investigate the ramifications of the criterion for the search of exclusively conjugate degradable channels.

quant-ph↗

arXiv2015

Conjugate degradable channels: A new class of quantum channels with a tractable quantum capacity formula

Conjugate degradable channels are channels whose quantum capacity is calculable. They were defined and studied in [1] where, however, only channels that are both degradable and conjugate degradable were found. In this paper we bring the very first example of conjugate degradable channels that are not degradable. We also identify the physical origin of these channels and show that they belong to the class of optimal universal asymmetric cloners. We thus not only positively answer the question whether conjugate degradable channels form a new class of channels with a single-letter capacity formula but as a side result we also calculate the quantum capacity of the optimal asymmetric 1->1+1 cloning channels.

quant-ph↗

arXiv2015

Black holes as bosonic Gaussian channels

We identify the quantum channels corresponding to the interaction of a Gaussian quantum state with an already formed Schwarzschild black hole. Using recent advances in the classification of one-mode bosonic Gaussian channels we find that (with one exception) the black hole Gaussian channels lie in the non-entanglement breaking subset of the lossy channels C(loss), amplifying channels C(amp) and classical-noise channels B2. We show that the channel parameters depend on the black hole mass and the properties of the potential barrier surrounding it. This classification enables us to calculate the classical and quantum capacity of the black hole and to estimate the quantum capacity where no tractable quantum capacity expression exists today. We discuss these findings in the light of the black hole quantum information loss problem.

quant-ph↗

arXiv2015

Hiking a generalized Dyck path: A tractable way of calculating multimode boson evolution operators

A time evolution operator in the interaction picture is given by exponentiating an interaction Hamiltonian $H$. Important examples of Hamiltonians, often encountered in quantum optics, condensed matter and high energy physics, are of a general form $H=r(A^\dagger-A)$, where $A$ is a multimode boson operator and $r$ is the coupling constant. If no simple factorization formula for the evolution operator exists, the calculation of the evolution operator is a notoriously difficult problem. In this case the only available option may be to Taylor expand the operator in $r$ and act on a state of interest $ψ$. But this brute-force method quickly hits the complexity barrier since the number of evaluated expressions increases exponentially. We relate a combinatorial structure called Dyck paths to the action of a boson word (monomial) and a large class of monomial sums on a quantum state $ψ$. This allows us to cross the exponential gap and make the problem of a boson unitary operator evaluation computationally tractable by achieving polynomial-time complexity for an extensive family of physically interesting multimode Hamiltonians. We further test our method on a cubic boson Hamiltonian whose Taylor series is known to diverge for all nonzero values of the coupling constant and an analytic continuation via a Padé approximant must be performed.

quant-ph↗