相关论文: Shaded Tangles for the Design and Verification of …
Networks based on entangled quantum systems enable interesting applications in quantum information processing and the understanding of the resulting quantum correlations is essential for advancing the technology. We show that the theory of…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…
Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum…
Distributed quantum information in networks is paramount for global secure quantum communication. Moreover, it finds applications as a resource for relevant tasks, such as clock synchronization, magnetic field sensing, and blind quantum…
Neural networks are being used to improve the probing of the state spaces of many particle systems as approximations to wavefunctions and in order to avoid the recurring sign problem of quantum monte-carlo. One may ask whether the usual…
Classification of different forms of quantum entanglement is an active area of research, central to development of effective quantum computers, and similar to classification of error-correction codes, where code duality is broadened to…
Scattering processes in high-energy physics are inherently quantum mechanical, yet are typically analyzed at the level of final states, where entanglement appears as a property of the outcome rather than a consequence of the underlying…
Recently, span programs have been shown to be equivalent to quantum query algorithms. It is an open problem whether this equivalence can be utilized in order to come up with new quantum algorithms. We address this problem by providing span…
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
We give an overview of different types of entanglement that can be generated in experiments, as well as of various protocols that can be used to verify or quantify entanglement. We propose several criteria that, we argue, should be applied…
Entanglement is a fundamental property of quantum systems, essential for non-trivial quantum programs. Identifying when qubits become entangled is critical for circuit optimization, and for arguing for the correctness of quantum algorithms.…
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…
The application of quantum computing to the field of image processing has produced several promising applications: quantum image representation techniques have been developed showing how, by taking advantage of quantum properties like…
A geometric framework for describing quantum particles on a possibly curved background is proposed. Natural constructions on certain distributional bundles (`quantum bundles') over the spacetime manifold yield a quantum ``formalism'' along…
Entanglement of high-dimensional quantum systems has become increasingly important for quantum communication and experimental tests of nonlocality. However, many effects of high-dimensional entanglement can be simulated by using multiple…
We derive a general framework to identify genuinely multipartite entangled mixed quantum states in arbitrary-dimensional systems and show in exemplary cases that the constructed criteria are stronger than those previously known. Our…
Recently, quantum entanglement has been presented as a cohomological obstruction to reconstructing a global quantum state from locally compatible information, where sheafification provides a functor that is forgetful with regards to…
We propose a unified mathematical scheme, based on a classical tensor isomorphism, for characterizing entanglement that works for pure states of multipartite systems of any number of particles. The degree of entanglement is indicated by a…
The subject of this work is quantum predicative programming -- the study of developing of programs intended for execution on a quantum computer. We look at programming in the context of formal methods of program development, or programming…