arXiv subjects

Daniel Reitzner

Publications and source records attributed to Daniel Reitzner.

At least 19 recordsLinked to original sources

arXiv2025

Systematic benchmarking of quantum computers: status and recommendations

Architectures for quantum computing can only be scaled up when they are accompanied by suitable benchmarking techniques. The document provides a comprehensive overview of the state and recommendations for systematic benchmarking of quantum computers. Benchmarking is crucial for assessing the performance of quantum computers, including the hardware, software, as well as algorithms and applications. The document highlights key aspects such as component-level, system-level, software-level, HPC-level, and application-level benchmarks. Component-level benchmarks focus on the performance of individual qubits and gates, while system-level benchmarks evaluate the entire quantum processor. Software-level benchmarks consider the compiler's efficiency and error mitigation techniques. HPC-level and cloud benchmarks address integration with classical systems and cloud platforms, respectively. Application-level benchmarks measure performance in real-world use cases. The document also discusses the importance of standardization to ensure reproducibility and comparability of benchmarks, and highlights ongoing efforts in the quantum computing community towards establishing these benchmarks. Recommendations for future steps emphasize the need for developing standardized evaluation routines and integrating benchmarks with broader quantum technology activities.

quant-ph↗

arXiv2023

Single Qubit State Estimation on NISQ Devices with Limited Resources and SIC-POVMs

Current quantum computers have the potential to overcome classical computational methods, however, the capability of the algorithms that can be executed on noisy intermediate-scale quantum devices is limited due to hardware imperfections. Estimating the state of a qubit is often needed in different quantum protocols, due to the lack of direct measurements. In this paper, we consider the problem of estimating the quantum state of a qubit in a quantum processing unit without conducting direct measurements of it. We consider a parameterized measurement model to estimate the quantum state, represented as a quantum circuit, which is optimized using the quantum tomographic transfer function. We implement and test the circuit using the quantum computer of the Technical Research Centre of Finland as well as an IBM quantum computer. We demonstrate that the set of positive operator-valued measurements used for the estimation is symmetric and informationally complete. Moreover, the resources needed for qubit estimation are reduced when direct measurements are allowed, keeping the symmetric property of the measurements.

quant-ph↗

arXiv2022

Anticipative measurements in hybrid quantum-classical computation

Before the availability of large scale fault-tolerant quantum devices, one has to find ways to make the most of current noisy intermediate-scale quantum devices. One possibility is to seek smaller repetitive hybrid quantum-classical tasks with higher fidelity, rather than directly pursuing large complex tasks. We present an approach in this direction where the quantum computation is supplemented by a classical result. While the presence of the supplementary classical information helps alone, taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. Anticipative quantum measurements lead to improved success rate over cases where we would use quantum measurements optimized without assuming the later arriving supplementing information. Importantly, in an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end, without the need for feedback from the one to the other computation, a feature which hence allows for running both computations in parallel. We demonstrate the method with an experiment using an IBMQ device and show that it leads to an improved success rate even in a real noisy setting.

quant-ph↗

arXiv2020

General measurements with limited resources and their application to quantum unambiguous state discrimination

In this report, we present a framework for implementing an arbitrary $n$-outcome generalized quantum measurement (POVM) on an $m$-qubit register as a sequence of two-outcome measurements requiring only single ancillary qubit. Our procedure offers a particular construction for the two-outcome partial measurements which can be composed into a full implementation of the measurement on any gate architecture. This implementation in general requires classical feedback; we present specific cases when this is not the case. We apply this framework on the unambiguous state discrimination and analyze possible strategies. In the simplest case, it gives the same construction as is known, if we opt for performing conclusiveness measurement first. However, it also offers possibility of performing measurement for one of the state outcomes first, leaving conclusiveness measurement for later. This shows flexibility of presented framework and opens possibilities for further optimization. We present discussion also on biased qubit case as well as general case of unambiguous quantum state discrimination in higher dimension.

quant-ph↗

arXiv2017

Finding paths with quantum walks or quantum walking through a maze

We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we provide an analytical result showing that by starting in a phase-modulated highly superposed initial state we can find the path in $O(M\sqrt{N}\log M)$ steps. Next, we improve this efficiency by showing that the recovery of the path can also be performed by a series of successive searches when we start at the last known position and search for the next connection in $O(\sqrt{N})$ steps leading to the overall efficiency of $O(M\sqrt{N})$. For this result we use the analytical solution that can be obtained for a ring of stars of double the length of the chain.

quant-ph↗

arXiv2016

Quantum incompatibility in collective measurements

We study the compatibility (or joint measurability) of quantum observables in a setting where the experimenter has access to multiple copies of a given quantum system, rather than performing the experiments on each individual copy separately. We introduce the index of incompatibility as a quantifier of incompatibility in this multi-copy setting, as well as the notion of compatibility stack representing the various compatibility relations present in a given set of observables. We then prove a general structure theorem for multi-copy joint observables, and use it to prove that all abstract compatibility stacks with three vertices have realizations in terms of quantum observables.

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

Incompatibility breaking quantum channels

A typical bipartite quantum protocol, such as EPR-steering, relies on two quantum features, entanglement of states and incompatibility of measurements. Noise can delete both of these quantum features. In this work we study the behavior of incompatibility under noisy quantum channels. The starting point for our investigation is the observation that compatible measurements cannot become incompatible by the action of any channel. We focus our attention to channels which completely destroy the incompatibility of various relevant sets of measurements. We call such channels incompatibility breaking, in analogy to the concept of entanglement breaking channels. This notion is relevant especially for the understanding of noise-robustness of the local measurement resources for steering.

quant-ph↗

arXiv2015

Noise Robustness of the Incompatibility of Quantum Measurements

The existence of incompatible measurements is a fundamental phenomenon having no explanation in classical physics. Intuitively, one considers given measurements to be incompatible within a framework of a physical theory, if their simultaneous implementation on a single physical device is prohibited by the theory itself. In the mathematical language of quantum theory, measurements are described by POVMs (positive operator valued measures), and given POVMs are by definition incompatible if they cannot be obtained via coarse-graining from a single common POVM; this notion generalizes noncommutativity of projective measurements. In quantum theory, incompatibility can be regarded as a resource necessary for manifesting phenomena such as Clauser-Horne-Shimony-Holt (CHSH) Bell inequality violations or Einstein-Podolsky-Rosen (EPR) steering which do not have classical explanation. We define operational ways of quantifying this resource via the amount of added classical noise needed to render the measurements compatible, i.e., useless as a resource. In analogy to entanglement measures, we generalize this idea by introducing the concept of incompatibility measure, which is monotone in local operations. In this paper, we restrict our consideration to binary measurements, which are already sufficient to explicitly demonstrate nontrivial features of the theory. In particular, we construct a family of incompatibility monotones operationally quantifying violations of certain scaled versions of the CHSH Bell inequality, prove that they can be computed via a semidefinite program, and show how the noise-based quantities arise as special cases. We also determine maximal violations of the new inequalities, demonstrating how Tsirelson's bound appears as a special case. The resource aspect is further motivated by simple quantum protocols where our incompatibility monotones appear as relevant figures of merit.

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↗

arXiv2013

Coexistence of effects from an algebra of two projections

The coexistence relation of quantum effects is a fundamental structure, describing those pairs of experimental events that can be implemented in a single setup. Only in the simplest case of qubit effects an analytic characterization of coexistent pairs is known. We generalize the qubit coexistence characterization to all pairs of effects in arbitrary dimension that belong to the von Neumann algebra generated by two projections. We demonstrate the presented mathematical machinery by several examples, and show that it covers physically relevant classes of effect pairs.

quant-ph↗

arXiv2013

Coexistence does not imply joint measurability

One of the hallmarks of quantum theory is the realization that distinct measurements cannot in general be performed simultaneously, in stark contrast to classical physics. In this context the notions of coexistence and joint measurability are employed to analyze the possibility of measuring together two general quantum observables, characterizing different degrees of compatibility between measurements. It is known that two jointly measurable observables are always coexistent, and that the converse holds for various classes of observables, including the case of observables with two outcomes. Here we resolve, in the negative, the open question whether this equivalence holds in general. Our resolution strengthens the notions of coexistence and joint measurability by showing that both are robust against small imperfections in the measurement setups.

quant-ph↗

arXiv2013

Fault-ignorant Quantum Search

We investigate the problem of quantum searching on a noisy quantum computer. Taking a 'fault-ignorant' approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and thereby find that the quadratic speedup is necessarily lost (in our noise models). However, for low but constant noise levels the algorithms we provide (based on Grover's algorithm) still outperform the best noiseless classical search algorithm.

quant-ph↗

arXiv2012

Strongly Incompatible Quantum Devices

The fact that there are quantum observables without a simultaneous measurement is one of the fundamental characteristics of quantum mechanics. In this work we expand the concept of joint measurability to all kinds of possible measurement devices, and we call this relation compatibility. Two devices are incompatible if they cannot be implemented as parts of a single measurement setup. We introduce also a more stringent notion of incompatibility, strong incompatibility. Both incompatibility and strong incompatibility are rigorously characterized and their difference is demonstrated by examples.

quant-ph↗

arXiv2012

Quantum Walks

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of processes (with rather different underlying dynamics) for producing random distributions. We discuss algorithmic applications for graph-searching and compare the two approaches. Next, we look at quantization of Markov chains and show how it can lead to speedups for sampling schemes. Finally, we turn to continuous time quantum walks and their applications, which provide interesting (even exponential) speedups over classical approaches.

quant-ph↗

arXiv2012

Quantum walks as a probe of structural anomalies in graphs

We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external vertices, are connected by edges. In the basic star graph, these are the only edges. If we now connect a subset of the external vertices to form a complete subgraph, a quantum walk can be used to find these vertices with a quantum speedup. Thus, under some circumstances, a quantum walk can be used to locate where the connectivity of a network changes. We also look at the case of two stars connected at one of their external vertices. A quantum walk can find the vertex shared by both graphs, again with a quantum speedup. This provides an example of using a quantum walk in order to find where two networks are connected. Finally, we use a quantum walk on a complete bipartite graph to find an extra edge that destroys the bipartite nature of the graph.

quant-ph↗

arXiv2010

Finding structural anomalies in graphs by means of quantum walks

We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are $N$ spokes, we show that a quantum walk can find an extra edge connecting two of the spokes or a spoke with a loop on it in $O(\sqrt{N})$ steps. We initially find that if all of the spokes have loops except one, the walk will not find the spoke without a loop, but this can be fixed if we choose the phase with which the particle is reflected from the vertex without the loop. Consequently, quantum walks can, under some circumstances, be used to find structural anomalies in graphs.

quant-ph↗

arXiv2010

Approximating incompatible von Neumann measurements simultaneously

We study the problem of performing orthogonal qubit measurements simultaneously. Since these measurements are incompatible, one has to accept additional imprecision. An optimal joint measurement is the one with the least possible imprecision. All earlier considerations of this problem have concerned only joint measurability of observables, while in this work we also take into account conditional state transformations (i.e., instruments). We characterize the optimal joint instrument for two orthogonal von Neumann instruments as being the Luders instrument of the optimal joint observable.

quant-ph↗