相关论文: Efficient classical simulation of slightly entangl…

In a previous paper [J.S.Briggs and A.Eisfeld, Phys.Rev.A 85, 052111] we showed that the time-development of the complex amplitudes of N coupled quantum states can be mapped by the time development of positions and velocities of N coupled…

Description of nonclassicality of states has hitherto been through violation of Bell inequality and non-separability, with the latter being a stronger constraint. In this paper, we show that this can be further sharpened, by introducing the…

Classical systems can be entangled. Entanglement is defined by coincidence correlations. Quantum entanglement experiments can be mimicked by a mechanical system with a single conserved variable and 77.8% conditional efficiency. Experiments…

Entanglement is the key resource for quantum technologies and is at the root of exciting many-body phenomena. However, quantifying the entanglement between two parts of a real-world quantum system is challenging when it interacts with its…

Quantum algorithms that can speed up certain tasks, such as factorisation and unstructured search, have driven a decades-long development of quantum computers and quantum technologies. Yet, outside specialized applications, quantum…

The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We show that if no entanglement is envolved then…

A complex but important challenge in understanding quantum mechanical phenomena is the simulation of quantum many-body dynamics. Although quantum computers offer significant potential to accelerate these simulations, their practical…

A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…

Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite…

This work explores entanglement-assisted communication, where quantum entanglement resources enable the transmission of classical information at an enhanced rate. We consider a scenario where entanglement is distributed ahead of time based…

We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a…

We study the pairwise entanglement present in a quantum computer that simulates a dynamically localized system. We show that the concurrence is exponentially sensitive to changes in the Hamiltonian of the simulated system. Moreover,…

How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not…

We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…

This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…

The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…

The speed-up provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speed-up are not yet completely understood…

Concordant computation is a circuit-based model of quantum computation for mixed states, that assumes that all correlations within the register are discord-free (i.e. the correlations are essentially classical) at every step of the…

We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to…

We show a similarity between two different classical simulation methods for measurement based quantum computation -- one relying on a low entanglement (tree tensor network) representation of the computer's state, and the other a tensor…