SearcharxivSearch

arXiv subjects

Michalis Skotiniotis

Publications and source records attributed to Michalis Skotiniotis.

At least 19 recordsLinked to original sources

Quantum sequential parameter testing

Sequential strategies in hypothesis testing use a variable number of measurement rounds, allowing a decision to be made as soon as the observed data provide a prescribed level of error tolerance. Although sequential testing is well established for a discrete set of hypotheses, extending this framework to a continuous parameter space poses additional challenges and has remained largely unexplored. In this article, we introduce sequential \textit{parameter testing}, a framework for determining an unknown parameter up to a prescribed tolerance by ruling out sufficiently distant competing values with a target error tolerance. We clarify its operational distinction from conventional parameter estimation and develop sequential tests for continuous families of hypotheses, introducing the \textit{twin-peaks test} as a natural and computationally efficient analog of sequential likelihood-ratio testing. We apply the framework to two paradigmatic quantum tasks: testing the phase and the purity of a qubit. For phase testing, we show numerically that adaptive projective measurements achieve the same average sample cost as collective covariant measurements with a fixed number of copies. For purity testing, local measurements are optimal, and sequential parameter testing yields significant average sample savings over fixed sample-size protocols. Our results establish parameter testing as an operationally meaningful framework for resource-efficient certification tasks involving continuous parameters.

quant-ph

Super-resolution of partially coherent bosonic sources

We consider imaging of two partially coherent sources and derive the ultimate quantum limits for estimating the separation, location, relative intensity, and coherence factor. We show that super-resolution in the separation is achievable both in the presence of nuisance parameters as well as when some of the parameters are assumed known. Nuisance parameters restrict super-resolution to balanced sources, whereas for known parameters super-resolution persists over a broader range of relative intensities and is lost only for perfectly correlated sources, i.e., $γ=1$. The achievable precision is governed primarily by interference-induced photon statistics and depends strongly on the degree of coherence. In the sub-Rayleigh regime, the imaging problem reduces to an effective two-dimensional Hilbert space description, provided a consistent reference position is used, with all parameters encoded in a Bloch vector representation. Finally, indirect estimation schemes based on the purity of the image-plane state are generally suboptimal for all non-zero coherence and become valid only in the incoherent limit.

quant-ph

Amplitude-amplified coherence detection and estimation

The detection and characterization of quantum coherence is of fundamental importance both in the foundations of quantum theory as well as for the rapidly developing field of quantum technologies, where coherence has been linked to quantum advantage. Typical approaches for detecting coherence employ {\it coherence witnesses} -- observable quantities whose expectation value can be used to certify the presence of coherence. By design, coherence witnesses are only able to detect coherence for some, but not all, possible states of a quantum system. In this work we construct protocols capable of detecting the presence of coherence in an {\it unknown} pure quantum state $|ψ\rangle$. Having access to $m$ copies of an unknown pure state $|ψ\rangle$ we show that the sample complexity of any experimental procedure for detecting coherence with constant probability of success $\ge 2/3$ is $Θ(c(|ψ\rangle)^{-1})$, where $c(|ψ\rangle)$ is the geometric measure of coherence of $|ψ\rangle$. However, assuming access to the unitary $U_ψ$ which prepares the unknown state $|ψ\rangle$, and its inverse $U_ψ^\dagger$, we devise a coherence detecting protocol that employs amplitude-amplification {\it a la} Grover, and uses a quadratically smaller number $O(c(|ψ\rangle)^{-1/2})$ of samples. Furthermore, by augmenting amplitude amplification with phase estimation we obtain an experimental estimation of upper bounds on the geometric measure of coherence within additive error $\varepsilon$ with a sample complexity that scales as $O(1/\varepsilon)$ as compared to the $O(1/\varepsilon^2)$ sample complexity of Monte Carlo estimation methods. The average number of samples needed in our amplitude estimation protocol provides a new operational interpretation for the geometric measure of coherence. Finally, we also derive bounds on the amount of noise our protocols are able to tolerate.

quant-ph

Sequential analysis in a continuous spin-noise quantum sensor

Many control and detection applications require real-time analysis of signals from sensors, in order to quickly and accurately act upon events revealed by the sensors. Such signal analysis benefits from statistical models of signal and sensor behavior. This creates a need for data analysis methods that are simultaneously model-based, computationally efficient and causal, in the sense that they employ only sensor data available prior to a specific point in time. In this work, we implement sequential data analysis techniques on a spin-noise-based quantum sensor, to perform two key tasks: hypothesis testing and quickest change-point detection. These online protocols allow us to detect weak magnetic fields by adaptively collecting measurement data until a predefined confidence threshold is reached. We demonstrate these methods in a realistic experimental setting and derive performance bounds for the achievable precision and response time. Our approach has potential utility when detecting small perturbations to the magnetic field, in both applied and fundamental contexts including biomagnetism, geophysical surveys, detection of concealed materials, searches for dark matter candidates and exotic spin interactions. Our results demonstrate that sequential techniques enable faster and more sensitive detection, making them a powerful tool for quantum sensing.

quant-ph

Cloning Quantum Channels

We consider the problem of deterministically cloning quantum channels with respect to the best attainable rate and the highest quality, so-called optimal cloning. We demonstrate that cloning quantum states is, in-fact, equivalent to cloning the trash-and-replace channel and therefore the former is a special case of the more general problem. By appealing to higher-order quantum operations (quantum processes) we construct a unified framework to deal with the most general cloning tasks and establish necessary conditions for a family of channels to exhibit super-replication -- a quadratic cloning rate with vanishing error. We find that noisy phase-gate channels satisfy these conditions, and we construct the explicit super-replicating process for the task. Conversely, we find that the criteria are not met by the full set of noisy unitary gates; classical noise channels; or amplitude damping channels, whose respective cloning rates are at most linear. In this paradigm, we not only derive new results, but also refigure known ones. We derive a strong converse for state cloning, and for unitary channels we construct an alternative super-replication process to that of Dür et al. [PRL 114, 120503 (2015)] and Chiribella et al. [PRL 114, 120504 (2015)] based on a measure-and-prepare process, which allows us to establish a direct connection between optimal channel cloning and Bayesian channel estimation. Finally we give an SDP algorithm to search for optimal cloning processes and study the advantage of coherent vs measure-and-prepare protocols on concrete examples.

quant-ph

Entanglement Detection with Quantum-inspired Kernels and SVMs

This work presents a machine learning approach based on support vector machines (SVMs) for quantum entanglement detection. Particularly, we focus in bipartite systems of dimensions 3x3, 4x4, and 5x5, where the positive partial transpose criterion (PPT) provides only partial characterization. Using SVMs with quantum-inspired kernels we develop a classification scheme that distinguishes between separable states, PPT-detectable entangled states, and entangled states that evade PPT detection. Our method achieves increasing accuracy with system dimension, reaching 80%, 90%, and nearly 100% for 3x3, 4x4, and 5x5 systems, respectively. Our results show that principal component analysis significantly enhances performance for small training sets. The study reveals important practical considerations regarding purity biases in the generation of data for this problem and examines the challenges of implementing these techniques on near-term quantum hardware. Our results establish machine learning as a powerful complement to traditional entanglement detection methods, particularly for higher-dimensional systems where conventional approaches become inadequate. The findings highlight key directions for future research, including hybrid quantum-classical implementations and improved data generation protocols to overcome current limitations.

quant-ph

Thermodynamics of Hamiltonian anyons with applications to quantum heat engines

The behavior of a collection of identical particles is intimately linked to the symmetries of their wavefunction under particle exchange. Topological anyons, arising as quasiparticles in low-dimensional systems, interpolate between bosons and fermions, picking up a complex phase when exchanged. Recent research has demonstrated that similar statistical behavior can arise with mixtures of bosonic and fermionic pairs, offering theoretical and experimental simplicity. We introduce an alternative implementation of such \emph{statistical anyons}, based on promoting or suppressing the population of symmetric states via a symmetry generating Hamiltonian. The scheme has numerous advantages: anyonic statistics emerge in a single particle pair, extending straightforwardly to larger systems; the statistical properties can be dynamically adjusted; and the setup can be simulated efficiently. We show how exchange symmetry can be exploited to improve the performance of heat engines, and demonstrate a reversible work extraction cycle in which bosonization and fermionization replace compression and expansion strokes. Additionally, we investigate emergent thermal properties, including critical phenomena, in large statistical anyon systems.

quant-ph

Universal algorithms for quantum data learning

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 Perspective, we review a line of works dealing with measurements that reveal structural properties of quantum datasets given in the form of product states. These algorithms are universal, meaning that their performances do not depend on the reference frame in which the dataset is provided. Requiring the universality property implies a characterization of optimal measurements via group representation theory.

quant-ph

Metrology-assisted entanglement distribution in noisy quantum networks

We consider the distribution of high-dimensional entangled states to multiple parties via noisy channels and the subsequent probabilistic conversion of these states to desired target states using stochastic local operations and classical communication. We show that such state-conversion protocols can be enhanced by embedded channel-estimation routines at no additional cost in terms of the number of copies of the distributed states. The defining characteristic of our strategy is the use of those copies for which the conversion was unsuccessful for the estimation of the noise, thus allowing one to counteract its detrimental effect on the successfully converted copies. Although this idea generalizes to various more complex situations, we focus on the realistic scenario, where only finitely many copies are distributed and where the parties are not required to process multiple copies simultaneously. In particular, we investigate the performance of so-called one-successful-branch protocols, applied sequentially to single copies and an adaptive Bayesian estimation strategy. Finally, we compare our strategy to more general but less easily practically implementable strategies involving distillation and the use of quantum memories to process multiple copies simultaneously.

quant-ph

How long does it take to implement a projective measurement?

According to the Schrödinger equation, a closed quantum system evolves continuously in time. If it is subject to a measurement however, its state changes randomly and discontinuously, which is mathematically described by the projection postulate. But how long does it take for this discontinuous change to occur? Based on simple estimates, whose validity rests solely on the fact that all fundamental forces in nature are finite-ranged, we show that the implementation of a quantum measurement requires a minimum time. This time scales proportionally with the diameter of the quantum mechanical object, on which the measured observable acts non-trivially, with the proportionality constant being around $10^{-5}$ s/m. We confirm our bound by comparison with experimentally reported measurement times for different platforms. We give a pedagogical exposition of our argumentation introducing along the way modern concepts such as ancilla-based measurements, the quantum speed limit, and Lieb-Robinson velocity bounds.

quant-ph

Squeezing-enhanced communication without a phase reference

We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the transmission line. This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor. The Holevo capacity of these channels is always attained with photon-number encodings, challenging with current technology. Hence for coherent-state encodings the optimal rate depends only on the total-energy distribution and we provide upper and lower bounds for all $m$, the latter attainable at low energies with on/off modulation and photodetection. We generalize this lower bound to squeezed-coherent encodings, exhibiting for the first time to our knowledge an unconditional advantage with respect to any coherent encoding for $m=1$ and a considerable advantage with respect to its direct coherent counterpart for $m>1$. This advantage is robust with respect to moderate attenuation, and persists in a regime where Fock encodings with up to two-photon states are also suboptimal. Finally, we show that the use of part of the energy to establish a reference frame is sub-optimal even at large energies. Our results represent a key departure from the case of phase-covariant Gaussian channels and constitute a proof-of-principle of the advantages of using non-classical, squeezed light in a motivated communication setting.

quant-ph

Quantum Sequential Hypothesis Testing

We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold, $ε$, when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as $\log 1/ε$, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., $ε=0$.

quant-ph

Beyond the swap test: optimal estimation of quantum state overlap

We study the estimation of the overlap between two unknown pure quantum states of a finite dimensional system, given $M$ and $N$ copies of each type. This is a fundamental primitive in quantum information processing that is commonly accomplished from the outcomes of $N$ swap-tests, a joint measurement on one copy of each type whose outcome probability is a linear function of the squared overlap. We show that a more precise estimate can be obtained by allowing for general collective measurements on all copies. We derive the statistics of the optimal measurement and compute the optimal mean square error in the asymptotic pointwise and finite Bayesian estimation settings. Besides, we consider two strategies relying on the estimation of one or both the states, and show that, although they are suboptimal, they outperform the swap test. In particular, the swap test is extremely inefficient for small values of the overlap, which become exponentially more likely as the dimension increases. Finally, we show that the optimal measurement is less invasive than the swap test and study the robustness to depolarizing noise for qubit states.

quant-ph

Quantum Godwin's Law

Godwin's law, i.e. the empirical observation that as an online discussion grows in time, the probability of a comparison with Nazis or Hitler quickly approaches unity, is one of the best-documented facts of the internet. Anticipating the quantum internet, here we show under reasonable model assumptions a polynomial quantum speedup of Godwin's law. Concretely, in quantum discussions, Hitler will be mentioned on average quadratically earlier, and we conjecture that under specific network topologies, even cubic speedups are possible. We also show that the speedup cannot be more than exponential, unless the polynomial hierarchy collapses to a certain finite level. We report on numerical experiments to simulate the appearance of the quantum Godwin law in future quantum internets; the most amazing finding of our studies is that -- unlike quantum computational speedups -- the quantum Godwin effect is not only robust against noise, but actually enhanced by decoherence. We have as yet no theoretical explanation, nor a good application, for this astonishing behaviour, which we dub quantum hyperpiesia.

quant-ph

Reinforcement learning for optimal error correction of toric codes

We apply deep reinforcement learning techniques to design high threshold decoders for the toric code under uncorrelated noise. By rewarding the agent only if the decoding procedure preserves the logical states of the toric code, and using deep convolutional networks for the training phase of the agent, we observe near-optimal performance for uncorrelated noise around the theoretically optimal threshold of 11%. We observe that, by and large, the agent implements a policy similar to that of minimum weight perfect matchings even though no bias towards any policy is given a priori.

quant-ph

Using and reusing coherence to realize quantum processes

Coherent superposition is a key feature of quantum mechanics that underlies the advantage of quantum technologies over their classical counterparts. Recently, coherence has been recast as a resource theory in an attempt to identify and quantify it in an operationally well-defined manner. Here we study how the coherence present in a state can be used to implement a quantum channel via incoherent operations and, in turn, to assess its degree of coherence. We introduce the robustness of coherence of a quantum channel---which reduces to the homonymous measure for states when computed on constant-output channels---and prove that: i) it quantifies the minimal rank of a maximally coherent state required to implement the channel; ii) its logarithm quantifies the amortized cost of implementing the channel provided some coherence is recovered at the output; iii) its logarithm also quantifies the zero-error asymptotic cost of implementation of many independent copies of a channel. We also consider the generalized problem of imperfect implementation with arbitrary resource states. Using the robustness of coherence, we find that in general a quantum channel can be implemented without employing a maximally coherent resource state. In fact, we prove that \textit{every} pure coherent state in dimension larger than $2$, however weakly so, turns out to be a valuable resource to implement \textit{some} coherent unitary channel. We illustrate our findings for the case of single-qubit unitary channels.

quant-ph

Quantum metrology with full and fast quantum control

We establish general limits on how precise a parameter, e.g. frequency or the strength of a magnetic field, can be estimated with the aid of full and fast quantum control. We consider uncorrelated noisy evolutions of N qubits and show that fast control allows to fully restore the Heisenberg scaling (~1/N^2) for all rank-one Pauli noise except dephasing. For all other types of noise the asymptotic quantum enhancement is unavoidably limited to a constant-factor improvement over the standard quantum limit (~1/N) even when allowing for the full power of fast control. The latter holds both in the single-shot and infinitely-many repetitions scenarios. However, even in this case allowing for fast quantum control helps to increase the improvement factor. Furthermore, for frequency estimation with finite resource we show how a parallel scheme utilizing any fixed number of entangled qubits but no fast quantum control can be outperformed by a simple, easily implementable, sequential scheme which only requires entanglement between one sensing and one auxiliary qubit.

quant-ph

Flexible resources for quantum metrology

Quantum metrology offers a quadratic advantage over classical approaches to parameter estimation problems by utilizing entanglement and nonclassicality. However, the hurdle of actually implementing the necessary quantum probe states and measurements, which vary drastically for different metrological scenarios, is usually not taken into account. We show that for a wide range of tasks in metrology, 2D cluster states (a particular family of states useful for measurement-based quantum computation) can serve as flexible resources that allow one to efficiently prepare any required state for sensing, and perform appropriate (entangled) measurements using only single qubit operations. Crucially, the overhead in the number of qubits is less than quadratic, thus preserving the quantum scaling advantage. This is ensured by using a compression to a logarithmically sized space that contains all relevant information for sensing. We specifically demonstrate how our method can be used to obtain optimal scaling for phase and frequency estimation in local estimation problems, as well as for the Bayesian equivalents with Gaussian priors of varying widths. Furthermore, we show that in the paradigmatic case of local phase estimation 1D cluster states are sufficient for optimal state preparation and measurement.

quant-ph