83.4k citations
- Centre National de la Recherche ScientifiqueFR2.8k papers
- Radboud University NijmegenNL2k papers
- National Institute for Subatomic PhysicsNL2k papers
- University of MichiganUS1.7k papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR1.7k papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR1.7k papers
- Columbia UniversityUS1.7k papers
- Stockholm UniversitySE1.6k papers
- University of OxfordGB1.6k papers
- University of ManchesterGB1.5k papers
- University College LondonGB1.5k papers
- The University of TokyoJP1.5k papers
17 papers · 2 filters
The quantum marginal independence problem
Sergio Hernández-Cuenca, Veronika E. Hubeny, Mukund Rangamani +1
We investigate whether the presence or absence of correlations between subsystems of an N-partite quantum system is solely constrained by the non-negativity and monotonicity of mut…
Conditions for superdecoherence
Joris Kattemölle, Jasper van Wezel
Decoherence is the main obstacle to quantum computation. The decoherence rate per qubit is typically assumed to be constant. It is known, however, that quantum registers coupling t…
Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes
Adam R. Brown, Hrant Gharibyan, Stefan Leichenauer +6
With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. Thes…
Single-step implementation of high fidelity -bit Toffoli gate
S. E. Rasmussen, K. Groenland, R. Gerritsma +2
The family of -bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in qua…
Secure Multi-party Quantum Computation with a Dishonest Majority
Yfke Dulek, Alex B. Grilo, Stacey Jeffery +2
The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed…
Scalable quantum computing with qudits on a graph
E. O. Kiktenko, A. S. Nikolaeva, Peng Xu +2
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done b…