arXiv subjects

Michal Sedlak

Publications and source records attributed to Michal Sedlak.

At least 19 recordsLinked to original sources

arXiv2026

Cost-aware Duration Prediction for Software Upgrades in Datacenters

Software upgrades are critical to maintaining server reliability in datacenters. While job duration prediction and scheduling have been extensively studied, the unique challenges posed by software upgrades remain largely under-explored. This paper presents the first in-depth investigation into software upgrade scheduling at datacenter scale. We begin by characterizing various types of upgrades and then frame the scheduling task as a constrained optimization problem. To address this problem, we introduce Acela, a cost-aware duration prediction framework designed to improve upgrade scheduling efficiency and throughput while meeting service-level objectives (SLOs). Acela accounts for asymmetric misprediction costs, strategically selects the best predictive models, and mitigates straggler-induced overestimations. Evaluations on Meta's production datacenter systems demonstrate that Acela significantly increases efficiency of the existing upgrade scheduler by improving upgrade window utilization by 1.25X, increasing the number of scheduled and completed upgrades by 33% and 41%, and reducing cancellation rates by 2.4X. The code and data sets will be released after paper acceptance.

cs.DC↗

arXiv2021

Classical Communications with Indefinite Causal Order for $N$ completely depolarizing channels

If two identical copies of a completely depolarizing channel are put into a superposition of their possible causal orders, they can transmit non-zero classical information. Here, we study how well we can transmit classical information with $N$ depolarizing channels put in superposition of $M$ causal orders via quantum SWITCH. We calculate Holevo quantity if the superposition uses only cyclic permutations of channels and find that it increases with $M$ and it is independent of $N$. For a qubit it never reaches $1$ if we are increasing $M$. On the other hand, the classical capacity decreases with the dimension $d$ of the message system. Further, for $N=3$ and $N=4$ we studied superposition of all causal orders and uniformly superposed causal orders belonging to different cosets created by cyclic permutation subgroup.

quant-ph↗

arXiv2017

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

Generalized Hofmann quantum process fidelity bounds for quantum filters

We propose and investigate bounds on quantum process fidelity of quantum filters, i.e. probabilistic quantum operations represented by a single Kraus operator K. These bounds generalize the Hofmann bounds on quantum process fidelity of unitary operations [H.F. Hofmann, Phys. Rev. Lett. 94, 160504 (2005)], and are based on probing the quantum filter by pure states forming two mutually unbiased bases. Determination of these bounds therefore requires much less measurements than full quantum process tomography. We find that it is particularly suitable to construct one of the probe basis from the right eigenstates of K, because in this case the bounds are tight in the sense that if the actual filter coincides with the ideal one then both the lower and upper bounds are equal to one. We theoretically investigate application of these bounds to a two-qubit optical quantum filter formed by interference of two photons on a partially polarizing beam splitter. For experimentally convenient choice of factorized input states and measurements we study the tightness of the bounds. We show that more stringent bounds can be obtained by more sophisticated processing of the data using convex optimization and we compare our methods for different choice of the input probe states.

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

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↗

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

Bounds on quantum process fidelity from minimum required number of quantum state fidelity measurements

To certify that an experimentally implemented quantum transformation is a certain unitary operation U on a d-dimensional Hilbert space, it suffices to determine fidelities of output states for d+1 suitably chosen pure input states [Reich et al., Phys. Rev. A 88, 042309 (2013)]. The set of these d+1 probe states can consist of d orthogonal states that form a basis and one additional state which is a balanced superposition of all d basis states. Here we provide an analytical lower bound on quantum process fidelity for two-qubit quantum gates which results from the knowledge of average state fidelity for the basis states and the fidelity of the superposition state. We compare this bound with the Hofmann bound that is based on knowledge of average state fidelities for two mutually unbiased bases. We also discuss possible extension of our findings to N-qubit operations.

quant-ph↗

arXiv2013

Efficient experimental estimation of fidelity of linear optical quantum Toffoli gate

We propose an efficiently measurable lower bound on quantum process fidelity of N-qubit controlled-Z gates. This bound is determined by average output state fidelities for N partially conjugate product bases. A distinct advantage of our approach is that only fidelities with product states need to be measured while keeping the total number of measurements much smaller than what is necessary for full quantum process tomography. As an application, we use this method to experimentally estimate quantum process fidelity F of a three-qubit linear optical quantum Toffoli gate and we find that F>=0.83. We also demonstrate the entangling capability of the gate by preparing GHZ-type three-qubit entangled states from input product states.

quant-ph↗

arXiv2013

Optimal processing of reversible quantum channels

We consider the general problem of the optimal transformation of N uses of (possibly different) unitary channels to a single use of another unitary channel in any finite dimension. We show how the optimal transformation can be fully parallelized, consisting in a preprocessing channel followed by a parallel action of all the N unitaries and a final postprocessing channel. Our techniques allow to achieve an exponential reduction in the number of the free parameters of the optimization problem making it amenable to an efficient numerical treatment. Finally, we apply our general results to find the analytical solution for special cases of interest like the cloning of qubit phase gates.

quant-ph↗

arXiv2011

Memory cost of quantum protocols

In this paper we consider the problem of minimizing the ancillary systems required to realize an arbitrary strategy of a quantum protocol, with the assistance of classical memory. For this purpose we introduce the notion of memory cost of a strategy, which measures the resources required in terms of ancillary dimension. We provide a condition for the cost to be equal to a given value, and we use this result to evaluate the cost in some special cases. As an example we show that any covariant protocol for the cloning of a unitary transformation requires at most one ancillary qubit. We also prove that the memory cost has to be determined globally, and cannot be calculated by optimizing the resources independently at each step of the strategy.

quant-ph↗

arXiv2011

Quantum learning algorithms for quantum measurements

We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements cannot be parallelized, and requires quantum memories for the storage of information.

quant-ph↗

arXiv2011

Extremal quantum protocols

Generalized quantum instruments correspond to measurements where the input and output are either states or more generally quantum circuits. These measurements describe any quantum protocol including games, communications, and algorithms. The set of generalized quantum instruments with a given input and output structure is a convex set. Here we investigate the extremal points of this set for the case of finite dimensional quantum systems and generalized instruments with finitely many outcomes. We derive algebraic necessary and sufficient conditions for extremality.

quant-ph↗

arXiv2011

Cloning of a quantum measurement

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about 1 -> 2 learning of the measurement, otherwise the task is called 1 -> 2 cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension of the Hilbert space. For 1 -> 2 cloning we also propose a simple quantum network that realizes the optimal strategy.

quant-ph↗

arXiv2010

Optimal unambiguous comparison of two unknown squeezed vacua

We propose a scheme for unambiguous state comparison (USC) of two unknown squeezed vacuum states of an electromagnetic field. Our setup is based on linear optical elements and photon-number detectors, and achieves optimal USC in an ideal case of unit quantum efficiency. In realistic conditions, i.e., for non-unit quantum efficiency of photodetectors, we evaluate the probability of getting an ambiguous result as well as the reliability of the scheme, thus showing its robustness in comparison to previous proposals.

quant-ph↗

arXiv2009

Unambiguous comparison of quantum measurements

The goal of comparison is to reveal the difference of compared objects as fast and reliably as possible. In this paper we formulate and investigate the unambiguous comparison of unknown quantum measurements represented by non-degenerate sharp POVMs. We distinguish between measurement devices with apriori labeled and unlabeled outcomes. In both cases we can unambiguously conclude only that the measurements are different. For the labeled case it is sufficient to use each unknown measurement only once and the average conditional success probability decreases with the Hilbert space dimension as 1/d. If the outcomes of the apparatuses are not labeled, then the problem is more complicated. We analyze the case of two-dimensional Hilbert space. In this case single shot comparison is impossible and each measurement device must be used (at least) twice. The optimal test state in the two-shots scenario gives the average conditional success probability 3/4. Interestingly, the optimal experiment detects unambiguously the difference with nonvanishing probability for any pair of observables.

quant-ph↗

arXiv2009

Unambiguous identification of coherent states II: Multiple resources

We consider unambiguous identification of coherent states of electromagnetic field. In particular, we study possible generalizations of an optical setup proposed in M. Sedlák {\it et al.}, Phys. Rev. A {\bf 76}, 022326 (2007). We show how the unambiguous identification of coherent states can be performed in a general case when multiple copies of unknown and the reference states are available. We also investigate whether reference states after the measurement can be "recovered" and further used for subsequent unambiguous identification tasks. We show that in spite of the fact that the recovered reference states are disturbed by measurements they can be repeatedly used for unambiguous identifications. We analyze the role of various imperfections in preparation of the unknown and the reference coherent states on the performance of our unambiguous identification setup.

quant-ph↗

arXiv2009

Unambiguous comparison of unitary channels

We address the problem of unambiguous comparison of a pair of unknown qudit unitary channels. Using the framework of process positive operator valued measures (PPOVM) we characterize all solutions and identify the optimal ones. We prove that the entanglement is the key ingredient in designing the optimal experiment for comparison of unitary channels. Without entanglement the optimality can not be achieved. The proposed scheme is also experimentally feasible.

quant-ph↗