Related papers: Computing with highly mixed states
Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry…
The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…
There are inherent limits in classical computation for it to serve as an adequate model of human cognition. In particular, non-commutativity, while ubiquitous in physics and psychology, cannot be sufficiently handled. We propose that we…
Quantum computing relies on processing information within a quantum system with many continuous degrees of freedom. The practical implementation of this idea requires complete control over all of the 2^n independent amplitudes of a…
We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two…
The principle of superposition is an intriguing feature of Quantum Mechanics, which is regularly exploited at various instances. A recent work [PRL \textbf{116}, 110403 (2016)] shows that the fundamentals of Quantum Mechanics restrict the…
Classical simulation of quantum physics is a central approach to investigating physical phenomena. Quantum computers enhance computational capabilities beyond those of classical resources, but it remains unclear to what extent existing…
"Broadcasting", namely distributing information over many users, suffers in-principle limitations when the information is quantum. This poses a critical issue in quantum information theory, for distributed processing and networked…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…
Qudit-based quantum computation offers unique advantages over qubit-based systems in terms of noise mitigation capabilities as well as algorithmic complexity improvements. However, the software ecosystem for multi-state quantum systems is…
We show that quantum computation circuits using coherent states as the logical qubits can be constructed from simple linear networks, conditional photon measurements and "small" coherent superposition resource states.
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…
Classical computers can simulate models of quantum computation with restricted input states. The identification of such states can sharpen the boundary between quantum and classical computations. Previous works describe simulable states of…
We provide a number of schemes for the splitting up of quantum information among $k$ parties using a $N$-qubit linear cluster state as a quantum channel, such that the original information can be reconstructed only if all the parties…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
We demonstrate the first implementation of a quantum algorithm on a liquid state nuclear magnetic resonance (NMR) quantum computer using almost pure states. This was achieved using a two qubit device where the initial state is an almost…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
Quantum state tomography (QST) aims at estimating a quantum state from averaged quantum measurements made on copies of the state. Most quantum algorithms rely on QST at some point and it is a well explored topic in the literature, mostly…