Related papers: Generating multipartite nonlocality to benchmark q…
Certification of quantum nonlocality plays a central role in practical applications like device-independent quantum cryptography and random number generation protocols. These applications entail the challenging problem of certifying quantum…
Quantum nonlocality, pioneered in Bell's seminal work and subsequently verified through a series of experiments, has drawn substantial attention due to its practical applications in various protocols. Evaluating and comparing the extent of…
Topological systems, such as fractional quantum Hall liquids, promise to successfully combat environmental decoherence while performing quantum computation. These highly correlated systems can support non-Abelian anyonic quasiparticles that…
Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking…
We introduce a method for testing quantum correlations in terms of quasiprobability functions in the presence of noise. We analyze the effects of measurement imperfection and thermal environment on quantum correlations and show that their…
In this work we explore how different types of resources are distributed among the states generated by quantum random circuits (QRC). We focus on multipartite non-locality, but we also analyze quantum correlations by appealing to different…
In a quantum network, distant observers sharing physical resources emitted by independent sources can establish strong correlations, which defy any classical explanation in terms of local variables. We discuss the characterization of…
Holistic benchmarks for quantum computers are essential for testing and summarizing the performance of quantum hardware. However, holistic benchmarks -- such as algorithmic or randomized benchmarks -- typically do not predict a processor's…
We study the nonlocality of arbitrary dimensional bipartite quantum states. By computing the maximal violation of a set of multi-setting Bell inequalities, an analytical and computable lower bound has been derived for general two-qubit…
As demand for quantum technologies increases, so does the need to generate and classify non-classical correlations in complex many-body systems. We introduce a simple and versatile method for creating and certifying entanglement and…
Noisy, intermediate-scale quantum computers come with intrinsic limitations in terms of the number of qubits (circuit "width") and decoherence time (circuit "depth") they can have. Here, for the first time, we demonstrate a recently…
Benchmarking of noise that is induced during the implementation of quantum gates is the main concern for practical quantum computers. Several protocols have been proposed that empirically calculate various metrics that quantify the error…
Determining whether an observed distribution of events generated in a quantum network is Bell local, i.e., if it admits an alternative realization in terms of independent local variables, is extremely challenging. Building upon…
Quantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be…
The barren plateau phenomenon is one of the main obstacles to implementing variational quantum algorithms in the current generation of quantum processors. Here, we introduce a method capable of avoiding the barren plateau phenomenon in the…
One of the main goals in the study of quantum nonlocality is to determine the maximum violation achieved by quantum correlations in a Bell scenario. However, given a Bell inequality, there is no general algorithm to perform this task. As an…
Nonlocality and quantum entanglement constitute two special aspects of the quantum correlations existing in quantum systems, which are of paramount importance in quantum-information theory. Traditionally, they have been regarded as…
Application-based benchmarks are increasingly used to quantify and compare quantum computers' performance. However, because contemporary quantum computers cannot run utility-scale computations, these benchmarks currently test this…
Randomness is a fundamental feature in nature and a valuable resource for applications ranging from cryptography and gambling to numerical simulation of physical and biological systems. Random numbers, however, are difficult to characterize…
Noise dominates every aspect of near-term quantum computers, rendering it exceedingly difficult to carry out even small computations. In this paper we are concerned with the modelling of noise in Noisy Intermediate-Scale Quantum (NISQ)…