arXiv subjects

Daniel Shapira

Publications and source records attributed to Daniel Shapira.

6 recordsLinked to original sources

arXiv2018

Sustainable Online Communities Exhibit Distinct Hierarchical Structures Across Scales of Size

Online communities exist in many forms and sizes, and are a source of considerable influence for individuals and organizations. Yet, there is limited insight into why some online communities are sustainable, while others cease to exist. We find that communities that fail to maintain a typical hierarchical social structure which balances cohesiveness across size scales do not survive, and can be distinguished from communities that exhibit such balance and prevail in the long term. Moreover, in an analysis of 10,122 real-life online communities with a total of 134,747 members over a period of more than a decade, we find that mapping the community social circle structure in the first 30 days of its lifetime is sufficient to forecast the survival of the community up to ten years in the future. By varying calibration time frames, the aspects of the social structure that allows for predictive power emerge and fixate within the first couple of months in a community's lifetime.

physics.soc-ph↗

arXiv2005

Entangled Quantum States Generated by Shor's Factoring Algorithm

The intermediate quantum states of multiple qubits, generated during the operation of Shor's factoring algorithm are analyzed. Their entanglement is evaluated using the Groverian measure. It is found that the entanglement is generated during the pre-processing stage of the algorithm and remains nearly constant during the quantum Fourier transform stage. The entanglement is found to be correlated with the speedup achieved by the quantum algorithm compared to classical algorithms.

quant-ph↗

arXiv2005

The Groverian Measure of Entanglement for Mixed States

The Groverian entanglement measure introduced earlier for pure quantum states [O. Biham, M.A. Nielsen and T. Osborne, Phys. Rev. A 65, 062312 (2002)] is generalized to the case of mixed states, in a way that maintains its operational interpretation. The Groverian measure of a mixed state of n qubits is obtained by a purification procedure into a pure state of 2n qubits, followed by an optimization process based on Uhlmann's theorem, before the resulting state is fed into Grover's search algorithm. The Groverian measure, expressed in terms of the maximal success probability of the algorithm, provides an operational measure of entanglement of both pure and mixed quantum states of multiple qubits. These results may provide further insight into the role of entanglement in making quantum algorithms powerful.

quant-ph↗

arXiv2003

One dimensional quantum walk with unitary noise

The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution Pt(n) at time t is very different from the Gaussian distribution obtained for the classical random walk. Furthermore, its standard deviation, sigma(t) scales as sigma(t) ~ t, unlike the classical random walk for which sigma(t) ~ sqrt{t}. It is shown that when the quantum walk is exposed to unitary noise, it exhibits a crossover from quantum behavior for short times to classical-like behavior for long times. The crossover time is found to be T ~ alpha^(-2) where alpha is the standard deviation of the noise.

quant-ph↗

arXiv2003

Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure

The Groverian entanglement measure, G(psi), is applied to characterize a variety of pure quantum states |psi> of multiple qubits. The Groverian measure is calculated analytically for certain states of high symmetry, while for arbitrary states it is evaluated using a numerical procedure. In particular, it is calculated for the class of Greenberger-Horne-Zeilinger states, the W states as well as for random pure states of n qubits. The entanglement generated by Grover's algorithm is evaluated by calculating G(psi) for the intermediate states that are obtained after t Grover iterations, for various initial states and for different sets of the marked states.

quant-ph↗

arXiv2000

Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations

The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by any other unitary transformation and the phase inversion is replaced by a rotation by an arbitrary angle. The time evolution of the amplitudes of the marked and unmarked states, for any initial complex amplitude distribution is expressed using first order linear difference equations. These equations are solved exactly. The solution provides the number of iterations T after which the probability of finding a marked state upon measurement is the highest, as well as the value of this probability, P_max. Both T and P_max are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments.

quant-ph↗