English
Related papers

Related papers: Fast controlled unitary protocols using group or q…

200 papers

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…

Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…

Quantum Physics · Physics 2025-06-26 Yin Mo , Tengxiang Lin , Xin Wang

Traditional resilient systems operate on fully-replicated fault-tolerant clusters, which limits their scalability and performance. One way to make the step towards resilient high-performance systems that can deal with huge workloads, is by…

Databases · Computer Science 2021-08-20 Jelle Hellings , Mohammad Sadoghi

A non-local unitary transformation of two qubits occurs when some Hamiltonian interaction couples them. Here we characterize the amount, as measured by time, of interaction required to perform two--qubit gates, when also arbitrarily fast,…

Quantum Physics · Physics 2009-11-07 K. Hammerer , G. Vidal , J. I. Cirac

We expose the information flow capabilities of pure bipartite entanglement as a theorem -- which embodies the exact statement on the `seemingly acausal flow of information' in protocols such as teleportation. We use this theorem to…

Quantum Physics · Physics 2007-05-23 Bob Coecke

Unitary control and decoherence appear to be irreconcilable in quantum mechanics. When a quantum system interacts with an environment, control strategies usually fail due to decoherence. In this letter, we propose a time-optimal unitary…

Quantum Physics · Physics 2013-02-20 P. M. Poggi , F. C. Lombardo , D. A. Wisniacki

Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which…

Quantum Physics · Physics 2025-02-04 Tushita Prasad , Markus Grassl

Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of…

Quantum Physics · Physics 2025-06-25 Alvin Gonzales , Eric Chitambar

The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…

We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as a quantum remote control. We investigate protocols which achieve this using local operations,…

Quantum Physics · Physics 2009-11-06 S. F. Huelga , J. A. Vaccaro , A. Chefles , M. B. Plenio

A general method for implementing weakly entangling multipartite unitary operations using a small amount of entanglement and classical communication is presented. For the simple Hamiltonian \sigma_z\otimes\sigma_z this method requires less…

Quantum Physics · Physics 2007-05-23 Dominic W. Berry

Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…

Quantum Physics · Physics 2026-04-16 Brian Doolittle , Felix Leditzky , Eric Chitambar

We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods. The operator applied on the target qubit is a unitary, special unitary, or the Pauli X…

Quantum Physics · Physics 2025-03-19 Ben Zindorf , Sougato Bose

We give trade-offs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a unit-resource capacity theorem that applies to the scenario where only…

Quantum Physics · Physics 2010-08-23 Min-Hsiu Hsieh , Mark M. Wilde

After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…

Quantum Physics · Physics 2013-01-22 N. Gisin , S. Wolf

Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows…

Quantum Physics · Physics 2011-10-17 Alberto Montina

In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…

Quantum Physics · Physics 2022-06-15 Martin J. Renner , Časlav Brukner

In 1999 Raz demonstrated a partial function that had an efficient quantum two-way communication protocol but no efficient classical two-way protocol and asked, whether there existed a function with an efficient quantum one-way protocol, but…

Computational Complexity · Computer Science 2022-04-05 Dmytro Gavinsky

Prepare-and-measure scenarios, in their many forms, can be seen as the basic building blocks of communication tasks. As such, they can be used to analyze a diversity of classical and quantum protocols -- of which dense coding and random…

Quantum Physics · Physics 2024-01-23 Carlos Vieira , Carlos de Gois , Lucas Pollyceno , Rafael Rabelo

As practical quantum networks prepare to serve an ever-expanding number of nodes, there has grown a need for advanced auxiliary classical systems that support the quantum protocols and maintain compatibility with the existing fiber-optic…

‹ Prev 1 3 4 5 6 7 10 Next ›