output
19942026
most citedQuantum secret sharing

3.4k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2013 · quant-phShow all

9 papers · 2 filters

quant-ph2013★ 44 cited

Maximally incompatible quantum observables

Teiko Heinosaari, Jussi Schultz, Alessandro Toigo +1

The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it…

quant-ph2013★ 14 cited

The Local Hamiltonian problem on a line with eight states is QMA-complete

Sean Hallgren, Daniel Nagaj, Sandeep Narayanaswami

The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has h…

quant-ph2013★ 33 cited

Dissociation and annihilation of multipartite entanglement structure in dissipative quantum dynamics

Sergey N. Filippov, Alexey A. Melnikov, Mario Ziman

We study the dynamics of the entanglement structure of a multipartite system experiencing a dissipative evolution. We characterize the processes leading to a particular form of out…

quant-ph2013★ 16 cited

Comment on "Quantum Szilard Engine"

Martin Plesch, Oscar Dahlsten, John Goold +1

In a recently published letter [S. W. Kim, T. Sagawa, S. DeLiberato, and M. Ueda, PRL 106, 070401 (2011)] the influence of particle statistics on extractable work in the Szilard en…

quant-ph2013★ 15 cited

Optimal processing of reversible quantum channels

Alessandro Bisio, Giacomo Mauro D'Ariano, Paolo Perinotti +1

We consider the general problem of the optimal transformation of N uses of (possibly different) unitary channels to a single use of another unitary channel in any finite dimension.…

quant-ph2013★ 10 cited

Fault-ignorant Quantum Search

Peter Vrana, David Reeb, Daniel Reitzner +1

We investigate the problem of quantum searching on a noisy quantum computer. Taking a 'fault-ignorant' approach, we analyze quantum algorithms that solve the task for various diffe…

quant-ph2013★ 27 cited

Bipartite entanglement-annihilating maps: necessary and sufficient conditions

S. N. Filippov, M. Ziman

We fully characterize bipartite entanglement-annihilating (EA) channels that destroy entanglement of any state shared by subsystems and, thus, should be avoided in any entanglement…

quant-ph2013★ 10 cited

Device-independent randomness amplification with a single device

Martin Plesch, Matej Pivoluska

Expansion and amplification of weak randomness with untrusted quantum devices has recently become a very fruitful topic of research. Here we contribute with a procedure for amplify…

quant-ph2013★ 12 cited

Quantum 3-SAT is QMA1-complete

David Gosset, Daniel Nagaj

Quantum satisfiability is a constraint satisfaction problem that generalizes classical boolean satisfiability. In the quantum k-SAT problem, each constraint is specified by a k-loc…