58 citations · 114 across the 5 of their papers we have counts for
6 papers
Efficiently contractable quantum circuits cannot produce much entanglement
Nadav Yoran
We show a similarity between two different classical simulation methods for measurement based quantum computation -- one relying on a low entanglement (tree tensor network) represe…
Classical simulability and the significance of modular exponentiation in Shor's algorithm
Nadav Yoran, Anthony J. Short
We show that a classical algorithm efficiently simulating the modular exponentiation circuit, for certain product state input and with measurements in a general product state basis…
Efficient classical simulation of the approximate quantum Fourier transform
Nadav Yoran, Anthony J. Short
We present a method for classically simulating quantum circuits based on the tensor contraction model of Markov and Shi (quant-ph/0511069). Using this method we are able to classic…
Methods for scalable optical quantum computation
Tal Mor, Nadav Yoran
We propose a scalable method for implementing linear optics quantum computation using the ``linked-state'' approach. Our method avoids the two-dimensional spread of errors occurrin…
Classical simulation of limited-width cluster-state quantum computation
Nadav Yoran, Anthony J. Short
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cl…
Deterministic linear optics quantum computation utilizing linked photon circuits
Nadav Yoran, Benni Reznik
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular qua…