Related papers: Random circuits by measurements on weighted graph …
Over a decade after its proposal, the idea of using quantum computers to sample hard distributions has remained a key path to demonstrating quantum advantage. Yet a severe drawback remains: verification seems to require classical…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
Spin network states are a powerful tool for constructing the $SU(2)$ gauge theories on a graph. In loop quantum gravity (LQG), they have yielded many promising predictions, although progress has been limited by the computational challenge…
Quantum entanglement lies at the heart of quantum mechanics in both fundamental and practical aspects. The entanglement of quantum states has been studied widely, however, the entanglement of operators has not been studied much in spite of…
Random dynamics in isolated quantum systems is of practical use in quantum information and is of theoretical interest in fundamental physics. Despite a large number of theoretical studies, it has not been addressed how random dynamics can…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
Tomograms are obtained as probability distributions and are used to reconstruct a quantum state from experimentally measured values. We study the evolution of tomograms for different quantum systems, both finite and infinite dimensional. In…
We develop a general theoretical framework for measurement protocols employing statistical correlations of randomized measurements. We focus on locally randomized measurements implemented with local random unitaries in quantum lattice…
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
Graph states are fundamental objects in the theory of quantum information due to their simple classical description and rich entanglement structure. They are also intimately related to IQP circuits, which have applications in quantum…
With the accelerating development of quantum technologies and their growing computational potential, quantum systems are being adapted for simulations and other critical tasks across diverse domains, making the reliability of the…
Detection of entanglement in quantum networks consisting of many parties is one of the important steps towards building quantum communication and computation networks. We consider a scenario where the measurement devices used for this…
Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the structure of a network is a classic procedure used to…
It is not currently known if quantum Turing machines can efficiently simulate probabilistic computations in the space-bounded case. In this paper we show that space-bounded quantum Turing machines can efficiently simulate a limited class of…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
We report a novel quantum random number generator based on the photon-number$-$path entangled state which is prepared via two-photon quantum interference at a beam splitter. The randomness in our scheme is of truly quantum mechanical origin…
We propose schemes to extract arbitrary graph states from two-dimensional cluster states by locally manipulating the qubits solely via single-qubit measurements. We introduce graph state manipulation tools that allow one to increase the…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
The ultimate random number generators are those certified to be unpredictable -- including to an adversary. The use of simple quantum processes promises to provide numbers that no physical observer could predict but, in practice, unwanted…
We introduce and analyze the entanglement properties of randomized hypergraph states, as an extended notion of the randomization procedure in the quantum logic gates for the usual graph states, recently proposed in the literature. The…