Related papers: Communication cost of simulating quantum correlati…
Classical and quantum physics provide fundamentally different predictions about experiments with separate observers that do not communicate, a phenomenon known as quantum nonlocality. This insight is a key element of our present…
A quantum computing circuit is presented that approximates a single spin wave quantum on a linear chain of spin 1/2 particles described by a Heisenberg Hamiltonian. The circuit is a product state where each qubit represents a spin. The spin…
We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized by an efficiently computable single-letter formula in terms…
We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communication in the classical interactive (bounded error) model.
In the quest for large-scale quantum computing, networked quantum computers offer a natural path towards scalability. Now that nearest neighbor entanglement has been demonstrated for electron spin qubits in semiconductors, on-chip long…
We study the one-clean-qubit model of quantum communication where one qubit is in a pure state and all other qubits are maximally mixed. We demonstrate a partial function that has a quantum protocol of cost $O(\log N)$ in this model,…
We discuss the communication complexity of establishing a shared reference frame, in particular examining the case of aligning spatial axes via the exchange of spin-1/2 particles. Unlike previous work we allow for multiple rounds of…
Single electron spins coupled to multiple nuclear spins provide promising multi-qubit registers for quantum sensing and quantum networks. The obtainable level of control is determined by how well the electron spin can be selectively coupled…
We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit…
Universal quantum computers require fault-tolerant logical qudits, as qudits naturally align with the simulation of multi-level physical systems. Here, we present a general framework and working examples for encoding fault-tolerant logical…
Entangled states that cannot be distilled to maximal entanglement are called bound entangled and they are often viewed as too weak to break the limitations of classical models. Here, we show a strongly contrasting result: that bound…
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate in existing…
We study a model of quantum computation based on the continuously-parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close…
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…
We prove a near optimal round-communication tradeoff for the two-party quantum communication complexity of disjointness. For protocols with $r$ rounds, we prove a lower bound of $\tilde{\Omega}(n/r + r)$ on the communication required for…
We theoretically investigate quantum spin transfer from spin-correlated conduction-electron pairs to localized spins in a ferromagnet, given that electrons are correlated intrinsically. We show that even spin-singlet pairs and triplet pairs…
Significant advances have been made towards fault-tolerant operation of silicon spin qubits, with single qubit fidelities exceeding 99.9%, several demonstrations of two-qubit gates based on exchange coupling, and the achievement of coherent…
For a $S=1$ system with even number of spins, the product states of two-body singlets, called the singlet pair states (SPSs), are overcomplete bases for the Hilbert space of many-body singlets. If the system contains odd number of spins, a…
The path-spin entangled state of a single spin-1/2 particle is considered which is generated by using a beam-spitter and a spin-flipper. Using this hybrid entanglement at the level of a single particle as a resource, we formulate a protocol…
We study the correlation complexity (or equivalently, the communication complexity) of generating a bipartite quantum state $\rho$. When $\rho$ is a pure state, we completely characterize the complexity for approximately generating $\rho$…