arXiv subjects

Mario Ziman

Publications and source records attributed to Mario Ziman.

At least 19 recordsLinked to original sources

arXiv2026

Exact Resource Laws for Passive Wavelength Routing in Entanglement Networks

Entanglement-based networks provide a scalable framework for multiuser quantum communication by passively routing spectrally correlated photon pairs across interconnected nodes. Several wavelength-allocation schemes have been demonstrated experimentally, but these designs do not yet give a general way to determine how spectral use, receiver load, repeated connections, and fan-out constrain one another. We address this problem through the network's connectivity graph, where the wavelength assignment becomes a resource-optimization problem. For one-sided fan-out, assigning each link to a center and grouping links with the same center gives an exact optimization for arbitrary networks and fan-out limits. We solve this for complete networks and for complete networks in which every user has one excluded partner. Allowing both conjugate wavelengths to fan out changes the resource landscape: a balanced binary hierarchy attains the minimum spectral-layer count for a complete network while reducing the maximum receiver load to logarithmic in the number of users. An eight-user complete network then makes explicit the competing roles of spectral efficiency, receiver load, redundancy, and fan-out. We include the passive-splitter loss and the dependence of the key rate on the delivered pair flux to determine the minimum total pair-generation rate required to meet the prescribed targets. Finally, we formulate the corresponding BBM92 quantum key distribution (QKD) secret-key-rate analysis for a continuous-wave-pumped broadband source, with true and accidental coincidences evaluated between detector channels at the two endpoint users and relative layer pair-generation rates fixed by the source spectrum. This framework, therefore, provides a direct route from exact network resource laws to the design and comparison of passive entanglement architectures under experimentally specified hardware constraints.

quant-ph↗

arXiv2024

Multiple-shot labeling of quantum observables

Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most general tester-based strategies, including adaptivity. For binary observables, we show that if perfect labeling is impossible in a single shot, then it remains impossible with any finite number of shots. In particular, we derive the formula for minimum-error performance and highlight its ``even-odd" behavior. For non-binary observables, we derive the optimal single-shot minimum-error success probability in closed form, and show that entanglement assistance does not improve this optimum. We also provide finite-shot schemes for (perfect or partial) labeling and give illustrative examples, including the qubit trine POVM where the optimal two-shot success probability is computed explicitly.

quant-ph↗

arXiv2022

Quantum dynamics is not strictly bidivisible

We address the question of the existence of quantum channels that are divisible in two quantum channels but not in three or, more generally, channels divisible in $n$ but not in $n+1$ parts. We show that for the qubit those channels \textit{do not} exist, whereas for general finite-dimensional quantum channels the same holds at least for full Kraus rank channels. To prove these results, we introduce a novel decomposition of quantum channels which separates them into a boundary and Markovian part, and it holds for any finite dimension. Additionally, the introduced decomposition amounts to the well-known connection between divisibility classes and implementation types of quantum dynamical maps, and can be used to implement quantum channels using smaller quantum registers.

quant-ph↗

arXiv2021

Minimum-error discrimination of thermal states

We study several variations of the question of minimum-error discrimination of thermal states. Besides of providing the optimal values for the probability of error, we also characterize the optimal measurements. For the case of a fixed Hamiltonian, we show that for a general discrimination problem the optimal measurement is the measurement in the energy basis of the Hamiltonian. We identify a critical temperature, determining whether the given temperature is best distinguishable from thermal state of very high or very low temperatures. Further, we investigate the decision problem of whether the thermal state is above or below some threshold value of the temperature. Also, in this case, the minimum-error measurement is the measurement in the energy basis. This is no longer the case once the thermal states to be discriminated have different Hamiltonians. We analyze a specific situation when the temperature is fixed but the Hamiltonians are different. For the considered case, we show the optimal measurement is independent of the fixed temperature and also of the strength of the interaction.

quant-ph↗

arXiv2021

Tripartite quantum-memory-assisted entropic uncertainty relations for multiple measurements

Quantum uncertainty relations are typically analyzed for a pair of incompatible observables, however, the concept per se naturally extends to situations of more than two observables. In this work, we obtain tripartite quantum memory-assisted entropic uncertainty relations and show that the lower bounds of these relations have three terms that depend on the complementarity of the observables, the conditional von-Neumann entropies, the Holevo quantities, and the mutual information. The saturation of these inequalities is analyzed.

quant-ph↗

arXiv2020

Private quantum channels for multi-photon pulses and unitary k-designs

We address the question of existence of private quantum channel for qubits encoded in polarization degrees of freedom of a photon, that remains secure even if multi-photon (instead of single-photon) pulse is emitted. We show that random unitary channel distributed according to SU(2) Haar measure has this property. Further we analyze the qubit unitary k-designs. We show they ensure security if the photons' parity of the source is guaranteed. Otherwise, the qubit unitary k-designs do not guarantee perfect security.

quant-ph↗

arXiv2018

Divisibility of qubit channels and dynamical maps

The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the \textit{simulability} of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al., Comm. Math. Phys., 279(1):147-168, 2008) and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the results of Phys. Rev. Lett., 101(15):150402, 2008. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement breaking, and open the question if something similar occurs for higher dimensions.

quant-ph↗

arXiv2015

An Invitation to Quantum Incompatibility

In the context of a physical theory, two devices, A and B, described by the theory are called incompatible if the theory does not allow the existence of a third device C that would have both A and B as its components. Incompatibility is a fascinating aspect of physical theories, especially in the case of quantum theory. The concept of incompatibility gives a common ground for several famous impossibility statements within quantum theory, such as ``no-cloning'' and ``no information without disturbance''; these can be all seen as statements about incompatibility of certain devices. The purpose of this paper is to give a concise overview of some of the central aspects of incompatibility.

quant-ph↗

arXiv2015

Incompatible measurements on quantum causal networks

The existence of incompatible measurements, epitomized by Heisenberg's uncertainty principle, is one of the distinctive features of quantum theory. So far, quantum incompatibility has been studied for measurements that test the preparation of physical systems. Here we extend the notion to measurements that test dynamical processes, possibly consisting of multiple time steps. Such measurements are known as testers and are implemented by interacting with the tested process through a sequence of state preparations, interactions, and measurements. Our first result is a characterization of the incompatibility of quantum testers, for which we provide necessary and sufficient conditions. Then, we propose a quantitative measure of incompatibility. We call this measure the robustness of incompatibility and define it as the minimum amount of noise that has to be added to a set of testers in order to make them compatible. We show that (i) the robustness is lower bounded by the distinguishability of the sequence of interactions used by the tester and (ii) maximum robustness is attained when the interactions are perfectly distinguishable. The general results are illustrated in the concrete example of binary testers probing the time-evolution of a single-photon polarization.

quant-ph↗

arXiv2015

Exploring boundaries of quantum convex structures: special role of unitary processes

We address the question of finding the most effective convex decompositions into boundary elements (so-called boundariness) for sets of quantum states, observables and channels. First we show that in general convex sets the boundariness essentially coincides with the question of the most distinguishable element, thus, providing an operational meaning for this concept. Unexpectedly, we discovered that for any interior point of the set of channels the optimal decomposition necessarily contains a unitary channel. In other words, for any given channel the best distinguishable one is some unitary channel. Further, we prove that boundariness is sub-multiplicative under composition of systems and explicitly evaluate its maximal value that is attained only for the most mixed elements of the considered convex structures.

quant-ph↗

arXiv2014

Process estimation in presence of time-invariant memory effects

Any repeated use of a fixed experimental instrument is subject to memory effects. We design an estimation method uncovering the details of the underlying interaction between the system and the internal memory without having any experimental access to memory degrees of freedom. In such case, by definition, any memoryless quantum process tomography (QPT) fails, because the observed data sequences do not satisfy the elementary condition of statistical independence. However, we show that the randomness implemented in certain QPT schemes is sufficient to guarantee the emergence of observable "statistical" patterns containing complete information on the memory channels. We demonstrate the algorithm in details for case of qubit memory channels with two-dimensional memory. Interestingly, we found that for arbitrary estimation method the memory channels generated by controlled unitary interactions are indistinguishable from memoryless unitary channels.

quant-ph↗

arXiv2014

Optimal single shot strategies for discrimination of quantum measurements

We study discrimination of m quantum measurements in the scenario when the unknown measurement with n outcomes can be used only once. We show that ancilla-assisted discrimination procedures provide a nontrivial advantage over simple (ancilla-free) schemes for perfect distinguishability and we prove that inevitably m <= n. We derive necessary and sufficient conditions of perfect distinguishability of general binary measurements. We show that the optimization of the discrimination of projective qubit measurements and their mixtures with white noise is equivalent to the discrimination of specific quantum states. In particular, the optimal protocol for discrimination of projective qubit measurements with fixed failure rate (exploiting maximally entangled test state) is described. While minimum error discrimination of two projective qubit measurements can be realized without any need of entanglement, we show that discrimination of three projective qubit measurements requires a bipartite probe state. Moreover, when the measurements are not projective, the non-maximally entangled test states can outperform the maximally entangled ones.

quant-ph↗

arXiv2014

Two Notes on Grover's Search: Programming and Discriminating

In this work we address two questions concerning Grover's algorithm. In the first we give an answer to the question how to employ Grover's algorithm for actual search over database. We introduce a quantum model of an unordered phone book (quantum database) with programmable queries to search in the phone book either for a number, or for a name. In the second part we investigate how successful the algorithm can be if the number of elements of the database is not known precisely. This question reduces to analysis of the distinguishability of states occurring during Grover's algorithm. We found that using unambiguous discrimination scheme even a seemingly good guess, that is close to the optimal one can result in a rather small success rate.

quant-ph↗

arXiv2014

Entanglement sensitivity to signal attenuation and amplification

We analyze general laws of continuous-variable entanglement dynamics during the deterministic attenuation and amplification of the physical signal carrying the entanglement. These processes are inevitably accompanied by noises, so we find fundamental limitations on noise intensities that destroy entanglement of gaussian and non-gaussian input states. The phase-insensitive amplification $\Phi_1 \otimes \Phi_2 \otimes \ldots \Phi_N$ with the power gain $\kappa_i \ge 2$ ($\approx 3$ dB, $i=1,\ldots,N$) is shown to destroy entanglement of any $N$-mode gaussian state even in the case of quantum limited performance. In contrast, we demonstrate non-gaussian states with the energy of a few photons such that their entanglement survives within a wide range of noises beyond quantum limited performance for any degree of attenuation or gain. We detect entanglement preservation properties of the channel $\Phi_1 \otimes \Phi_2$, where each mode is deterministically attenuated or amplified. Gaussian states of high energy are shown to be robust to very asymmetric attenuations, whereas non-gaussian states are at an advantage in the case of symmetric attenuation and general amplification. If $\Phi_1 = \Phi_2$, the total noise should not exceed $\frac{1}{2} \sqrt{\kappa^2+1}$ to guarantee entanglement preservation.

quant-ph↗

arXiv2014

Distance to boundary and minimum-error discrimination

We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any explicit topology) how far the given element is from the boundary. It is shown that one of the elements from the boundary can be always chosen to be an extremal element. We focus on evaluation of this quantity for quantum sets of states, channels and observables. We show that boundariness is intimately related to (semi)norms that provide an operational interpretation of this quantity. In particular, the minimum error probability for discrimination of a pair of quantum devices is lower bounded by the boundariness of each of them. We proved that for states and observables this bound is saturated and conjectured this feature for channels. The boundariness is zero for infinite-dimensional quantum objects as in this case all the elements are boundary elements.

quant-ph↗

arXiv2013

Maximally incompatible quantum observables

The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.

quant-ph↗

arXiv2013

Dissociation and annihilation of multipartite entanglement structure in dissipative quantum dynamics

We study the dynamics of the entanglement structure of a multipartite system experiencing a dissipative evolution. We characterize the processes leading to a particular form of output system entanglement and provide a recipe for their identification via concatenations of particular linear maps with entanglement-breaking operations. We illustrate the applicability of our approach by considering local and global depolarizing noises acting on general multiqubit states. A difference in the typical entanglement behavior of systems subjected to these noises is observed: the originally genuine entanglement dissociates by splitting off particles one by one in the case of local noise, whereas intermediate stages of entanglement clustering are present in the case of global noise. We also analyze the definitive phase of evolution when the annihilation of the entanglement compound finally takes place.

quant-ph↗

arXiv2012

Direct estimation of decoherence rates

The decoherence rate is a nonlinear channel parameter that describes quantitatively the decay of the off-diagonal elements of a density operator in the decoherence basis. We address the question of how to experimentally access such a nonlinear parameter directly without the need of complete process tomography. In particular, we design a simple experiment working with two copies of the channel, in which the registered mean value of a two-valued measurement directly determines the value of the average decoherence rate. No prior knowledge of the decoherence basis is required.

quant-ph↗