Related papers: Equivalence checking of quantum circuits by nonloc…
The structure of Bell-type inequalities detecting genuine multipartite non-locality, and hence detecting genuine multipartite entanglement, is investigated. We first present a simple and intuitive approach to Svetlichny's original…
Quantum networks are essential for advancing scalable quantum information processing. Quantum nonlocality sharing provides a crucial strategy for the resource-efficient recycling of quantum correlations, offering a promising pathway toward…
We provide a method of designing protocols for implementing multipartite quantum measurements when the parties are restricted to local operations and classical communication (LOCC). For each finite integer number of rounds, $r$, the method…
Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep understanding of quantum circuit properties and their…
We present a method to test quantum behavior of quantum information processing devices, such as quantum memories, teleportation devices, channels and quantum key distribution protocols. The test of quantum behavior can be phrased as the…
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for…
Continuous-variable quantum states are of particular importance in various quantum information processing tasks including quantum communication and quantum sensing. However, a bottleneck has emerged with the fast increasing in size of the…
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an…
Like entanglement, quantum discord quantifies the quantum correlations. Unlike entanglement, whose detection is extremely difficult, the quantum discord of an arbitrary bipartite state allows itself to be detected perfectly by a single…
The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their…
It is a well-known fact that measurement incompatibility is a necessary resource to generate nonlocal correlations in usual Bell scenario that typically involves single quantum source. We can provide with some contrasting findings if we…
The task of non-local quantum computation requires implementation of a unitary on $n$ qubits between two parties with only one round of communication, ideally with minimal pre-shared entanglement. We introduce a new protocol that makes use…
Although entanglement is widely recognized as one of the most fascinating characteristics of quantum mechanics, nonlocality remains to be a big labyrinth. The proof of existence of nonlocality is as yet not much convincing because of its…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
It is well known that the effect of quantum nonlocality, as witnessed by violation of a Bell inequality, can be observed even when relaxing the assumption of measurement independence, i.e. allowing for the source to be partially correlated…
Quantum processors with sizes in the 10-100 qubit range are now increasingly common. However, with increased size comes increased complexity for benchmarking. The effectiveness of a given device may vary greatly between different tasks, and…
Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller…
In this paper, we consider the problem of entanglement verification across the quantum memories of any two nodes of a quantum network. Its solution can be a means for detecting (albeit not preventing) the presence of intruders that have…
We propose experimentally feasible separability criteria for bipartite systems based on local symmetric measurements. Through detailed examples, we demonstrate that our criteria can detect entanglement more effectively compared to existing…
Simulating quantum circuits (QC) on high-performance computing (HPC) systems has become an essential method to benchmark algorithms and probe the potential of large-scale quantum computation despite the limitations of current quantum…