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 2009 · quant-phShow all

7 papers · 2 filters

quant-ph2009★ 29 cited

Fast Universal Quantum Computation with Railroad-switch Local Hamiltonians

Daniel Nagaj

We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second…

quant-ph2009★ 49 cited

Efficient compression of quantum information

Martin Plesch, Vladimir Buzek

We propose a scheme for an exact efficient transformation of a tensor product state of many identically prepared qubits into a state of a logarithmically small number of qubits. Us…

quant-ph2009★ 18 cited

Unambiguous comparison of quantum measurements

Mario Ziman, Teiko Heinosaari, Michal Sedlak

The goal of comparison is to reveal the difference of compared objects as fast and reliably as possible. In this paper we formulate and investigate the unambiguous comparison of un…

quant-ph2009★ 8 cited

Coexistence of quantum operations

Teiko Heinosaari, Daniel Reitzner, Peter Stano +1

Quantum operations are used to describe the observed probability distributions and conditional states of the measured system. In this paper, we address the problem of their joint m…

quant-ph2009

Fast Amplification of QMA

Daniel Nagaj, Pawel Wocjan, Yong Zhang

Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the `yes' and `no' cases, with a method that is…

quant-ph2009★ 7 cited

Quantum Machines

Mark Hillery, Vladimir Buzek

We discuss quantum information processing machines. We start with single purpose machines that either redistribute quantum information or identify quantum states. We then move on t…

quant-ph2009★ 4 cited

Efficient Circuits for Quantum Walks

Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan

We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph…