We treat privacy in a network of quantum sensors where accessible information is limited to specific functions of the network parameters, and all other information remains private. We develop an analysis of privacy in...
详细信息
We treat privacy in a network of quantum sensors where accessible information is limited to specific functions of the network parameters, and all other information remains private. We develop an analysis of privacy in terms of a manipulation of the quantum Fisher information matrix, and find the optimal state achieving maximum privacy in the estimation of linear combination of the unknown parameters in a network of quantum sensors. We also discuss the effect of uncorrelated noise on the privacy of the network. Moreover, we illustrate our results with an example where the goal is to estimate the average value of the unknown parameters in the network. In this example, we also introduce the notion of quasiprivacy (ε privacy), quantifying how close the state is to being private.
Lloyd et al. [Nat. Commun. 7, 10138 (2016)] were first to demonstrate the promise of quantumalgorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, ...
详细信息
Lloyd et al. [Nat. Commun. 7, 10138 (2016)] were first to demonstrate the promise of quantumalgorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for topological data analysis (TDA) with reduced scaling, including a method for preparing Dicke states based on inequality testing, a more efficient amplitude estimation algorithm using Kaiser windows, and an optimal implementation of eigenvalue projectors based on Chebyshev polynomials. We compile our approach to a fault-tolerant gate set and estimate constant factors in the Toffoli complexity. Our analysis reveals that superquadratic quantum speedups are only possible for this problem when targeting a multiplicative error approximation and the Betti number grows asymptotically. Further, we propose a dequantization of the quantum TDA algorithm that shows that having exponentially large dimension and Betti number are necessary, but insufficient conditions, for superpolynomial advantage. We then introduce and analyze specific problem examples which have parameters in the regime where superpolynomial advantages may be achieved, and argue that quantum circuits with tens of billions of Toffoli gates can solve seemingly classically intractable instances.
Device-independent randomness certification based on Bell nonlocality does not require any assumptions about the devices, thus provides adequate security. Great effort has been made to demonstrate that nonlocality is ...
详细信息
Device-independent randomness certification based on Bell nonlocality does not require any assumptions about the devices, thus provides adequate security. Great effort has been made to demonstrate that nonlocality is necessary for generating quantum randomness, but the minimal resource required has not been clarified. Here we prove and experimentally demonstrate that violating any two-input Bell inequality is both necessary and sufficient for certifying randomness, however, for the multiple-input cases, this sufficiency ceases to apply, leading to certain states exhibiting Bell nonlocality without the capability to certify randomness. We examine two typical classes of Bell inequalities with multiple input and multiple output, the facet inequalities and Salavrakos-Augusiak-Tura-Wittek-Acín-Pironio inequalities, in the high-dimensional photonic system, and observe that the violation of the latter one can always certify randomness which is not true for the former. The private randomness with a generation rate of 1.867±0.018 bits per photon pair is obtained in the scenario of Salavrakos-Augusiak-Tura-Wittek-Acín-Pironio inequalities with 3-input and 4-output. Our Letter unravels the internal connection between randomness and nonlocality, effectively enhancing the performance of tasks such as device-independent random number generation.
quantum nonlocality describes a stronger form of quantum correlation than that of entanglement. It refutes Einstein’s belief of local realism and is among the most distinctive and enigmatic features of quantum mechan...
详细信息
quantum nonlocality describes a stronger form of quantum correlation than that of entanglement. It refutes Einstein’s belief of local realism and is among the most distinctive and enigmatic features of quantum mechanics. It is a crucial resource for achieving quantum advantages in a variety of practical applications, ranging from cryptography and certified random number generation via self-testing to machine learning. Nevertheless, the detection of nonlocality, especially in quantum many-body systems, is notoriously challenging. Here, we report an experimental certification of genuine multipartite Bell-operator correlations, which signal nonlocality in quantum many-body systems, up to 24 qubits with a fully programmable superconducting quantum processor. In particular, we employ energy as a Bell-operator correlation witness and variationally decrease the energy of a many-body system across a hierarchy of thresholds, below which an increasing Bell-operator correlation depth can be certified from experimental data. We variationally prepare the low-energy state of a two-dimensional honeycomb model with 73 qubits and certify its Bell-operator correlations by measuring an energy that surpasses the corresponding classical bound with up to 48 standard deviations. In addition, we variationally prepare a sequence of low-energy states and certify their genuine multipartite Bell-operator correlations up to 24 qubits via energies measured efficiently by parity oscillation and multiple quantum coherence techniques. Our results establish a viable approach for preparing and certifying multipartite Bell-operator correlations, which provide not only a finer benchmark beyond entanglement for quantum devices, but also a valuable guide toward exploiting multipartite Bell correlations in a wide spectrum of practical applications.
Reduced density matrices (RDMs) are fundamental in quantum information processing, allowing the computation of local observables, such as energy and correlation functions, without the exponential complexity of fully c...
Reduced density matrices (RDMs) are fundamental in quantum information processing, allowing the computation of local observables, such as energy and correlation functions, without the exponential complexity of fully characterizing quantum states. In the context of near-term quantum computing, RDMs provide sufficient information to effectively design variational quantumalgorithms. However, their experimental estimation is challenging, as it involves preparing and measuring quantum states in multiple bases, a resource-intensive process susceptible to producing nonphysical RDMs due to shot noise from limited measurements. To address this, we propose a method to mitigate shot noise by reenforcing certain physicality constraints on RDMs. While verifying RDM compatibility with a global state is quantum Merlin-Arthur complete, we relax this condition by enforcing compatibility constraints up to a certain level using a polynomial-size semidefinite program to reconstruct overlapping RDMs from simulated data. Our approach yields, on average, tighter bounds for the same number of measurements compared to tomography without compatibility constraints. We demonstrate the versatility and efficacy of our method by integrating it into an algorithmic cooling procedure to prepare low-energy states of local Hamiltonians. Simulations on frustrated Hamiltonians reveal notable improvements in accuracy and resource efficiency, highlighting the potential of our approach for practical applications in near-term quantum computing.
暂无评论