output
20132026
most citedExperimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km

2.8k citations

Showing 2014Show all

6 papers · 1 filter

cond-mat.stat-mech2014★ 430 cited

Brownian Carnot engine

Ignacio A. Martínez, Édgar Roldán, Luis Dinis +3

The Carnot cycle imposes a fundamental upper limit to the efficiency of a macroscopic motor operating between two thermal baths. However, this bound needs to be reinterpreted at mi…

quant-ph2014★ 87 cited

Requirements for a loophole-free photonic Bell test using imperfect setting generators

Johannes Kofler, Marissa Giustina, Jan-Åke Larsson +1

Experimental violations of Bell inequalities are in general vulnerable to so-called "loopholes." In this work, we analyse the characteristics of a loophole-free Bell test with phot…

cond-mat.quant-gas2014★ 50 cited

Cold bosons in optical lattices: a tutorial for Exact Diagonalization

David Raventós, Tobias Graß, Maciej Lewenstein +1

Exact diagonalization techniques are a powerful method for studying many-body problems. Here, we apply this method to systems of few bosons in an optical lattice, and use it to dem…

quant-ph2014

Weak value amplification: a view from quantum estimation theory that highlights what it is and what isn't

Juan P. Torres, Luis Jose Salazar-Serrano

Weak value amplification (WVA) is a concept that has been extensively used in a myriad of applications with the aim of rendering measurable tiny changes of a variable of interest.…

quant-ph2014★ 118 cited

Reliable quantum certification for photonic quantum technologies

L. Aolita, C. Gogolin, M. Kliesch +1

A major roadblock for large-scale photonic quantum technologies is the lack of practical reliable certification tools. We introduce an experimentally friendly - yet mathematically…

quant-ph2014★ 31 cited

Algorithmic Pseudorandomness in Quantum Setups

Ariel Bendersky, Gonzalo de la Torre, Gabriel Senno +2

The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. Wh…