相关论文: Macroscopic entanglement in Quantum Computation
Quantum entanglement is the quintessence of quantum information processing mostly limited to the microscopic regime governed by Heisenberg uncertainty principle. For practical applications, however, macroscopic entanglement gives great…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…
A construction is given for simulating any deterministic finite state machine (FSM) on a quantum computer in a space-efficient manner. By constructing a superposition of input strings of lengths K or less, questions can be asked about the…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
The previously proposed Heisenberg-type relation $ E_c t_c >> \hbar {\cal C}$ for the energy used by a quantum computer, the total computation time and the logical ("classical") complexity of the problem is verified for the following…
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have…
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY.…
We consider finite macroscopic systems, i.e., systems of large but finite degrees of freedom, which we believe are poorly understood as compared with small systems and infinite systems. We focus on pure states that do not have the `cluster…
We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We…
We study a generalization of entanglement testing which we call the "hidden cut problem." Taking as input copies of an $n$-qubit pure state which is product across an unknown bipartition, the goal is to learn precisely where the state is…
The one clean qubit model of quantum computation (DQC1) efficiently implements a computational task that is not known to have a classical alternative. During the computation, there is never more than a small but finite amount of…
Recently, a framework was established to systematically construct novel universal resource states for measurement-based quantum computation using techniques involving finitely correlated states. With these methods, universal states were…
Entanglement are the non-local correlations permitted by quantum theory, believed to play a fundamental role in a quantum computer. We have investigated these correlations in a number of theoretical models for condensed matter systems. Such…
We discuss the concept of how entanglement changes with respect to different factorizations of the total algebra which describes the quantum states. Depending on the considered factorization a quantum state appears either entangled or…
The quantum guesswork quantifies the minimum number of queries needed to guess the state of a quantum ensemble if one is allowed to query only one state at a time. Previous approaches to the computation of the guesswork were based on…
We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using simple adiabatic techniques. The…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum…
It is possible to construct a classical, macroscopic system which has a mathematical structure that is exactly the same as that of a quantum mechanical system and which can be put into a state which is identical to quantum mechanical…