Related papers: Property testing of unitary operators
In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to…
The quantification of the quantumness of a quantum ensemble has theoretical and practical significance in quantum information theory. We propose herein a class of measures of the quantumness of quantum ensembles using the unitary similarity…
How much does local and time-periodic dynamics resemble a random unitary? In the present work we address this question by using the Clifford formalism from quantum computation. We analyse a Floquet model with disorder, characterised by a…
We describe how randomized benchmarking can be used to reconstruct the unital part of any trace-preserving quantum map, which in turn is sufficient for the full characterization of any unitary evolution, or more generally, any unital…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
Boundary theories of static bulk topological phases of matter are obstructed in the sense that they cannot be realized on their own as isolated systems. The obstruction can be quantified/characterized by quantum anomalies, in particular…
We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…
We initiate a thorough study of \emph{distributed property testing} -- producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called \emph{dense} testing model we emulate…
Memory safety defects pose a major threat to software reliability, enabling cyberattacks, outages, and crashes. To mitigate these risks, organizations adopt Compositional Bounded Model Checking (BMC), using unit proofs to formally verify…
From the set of operators for errors and its correction code, we introduce the so-called complete unitary transformation. It can be used for encoding while the inverse of it can be applied for correcting the errors of the encoded qubit. We…
We show a systematic construction for implementing general measurements on a single qubit, including both strong (or projection) and weak measurements. We mainly focus on linear optical qubits. The present approach is composed of simple and…
We compare the multipartite entangling and disentangling powers of unitary operators by assessing their ability to generate or eliminate genuine multipartite entanglement. Our findings reveal that while diagonal unitary operators can…
We study the impact of quantum computation on the fundamental problem of testing the property of distributions. In particular, we focus on testing whether two unknown classical distributions are close or far enough, and propose the…
We suggest and demonstrate a tomographic method to fully characterize homodyne detectors at the quantum level. The operator measure associated with the detector is expanded in the quadrature basis and probed with a set of coherent states.…
A test of uniformity on [0,1] is developed for the setting of a single observation recorded with sufficient precision. Although consistency against general alternatives is not attainable with only one draw in the classical large-sample…
We consider the problem of deciding whether an $n$-qubit unitary (or $n$-bit Boolean function) is $\varepsilon_1$-close to some $k$-junta or $\varepsilon_2$-far from every $k$-junta, where $k$-junta unitaries act non-trivially on at most…
It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is {\em impossible} to do so if the transformation is anti-linear and…
We formalize a problem we call combinatorial pair testing (CPT), which has applications to the identification of uncooperative or unproductive participants in pair programming, massively distributed computing, and crowdsourcing…
Checking whether two quantum circuits are approximately equivalent is a common task in quantum computing. We consider a closely related identity check problem: given a quantum circuit $U$, one has to estimate the diamond-norm distance…
The task of state discrimination for a set of mutually orthogonal pure states is trivial if one has access to the corresponding sharp (projection-valued) measurement, but what if we are restricted to an unsharp measurement? Given that any…