arXiv subjects

Vladimir Buzek

Publications and source records attributed to Vladimir Buzek.

At least 19 recordsLinked to original sources

arXiv2015

Thermodynamic model of social influence on two-dimensional square lattice: Case for two features

We propose a thermodynamic multi-state spin model in order to describe equilibrial behavior of a society. Our model is inspired by the Axelrod model used in social network studies. In the framework of the statistical mechanics language, we analyze phase transitions of our model, in which the spin interaction $J$ is interpreted as a mutual communication among individuals forming a society. The thermal fluctuations introduce a noise $T$ into the communication, which suppresses long-range correlations. Below a certain phase transition point $T_t$, large-scale clusters of the individuals, who share a specific dominant property, are formed. The measure of the cluster sizes is an order parameter after spontaneous symmetry breaking. By means of the Corner transfer matrix renormalization group algorithm, we treat our model in the thermodynamic limit and classify the phase transitions with respect to inherent degrees of freedom. Each individual is chosen to possess two independent features $f=2$ and each feature can assume one of $q$ traits (e.g. interests). Hence, each individual is described by $q^2$ degrees of freedom. A single first order phase transition is detected in our model if $q>2$, whereas two distinct continuous phase transitions are found if $q=2$ only. Evaluating the free energy, order parameters, specific heat, and the entanglement von Neumann entropy, we classify the phase transitions $T_t(q)$ in detail. The permanent existence of the ordered phase (the large-scale cluster formation with a non-zero order parameter) is conjectured below a non-zero transition point $T_t(q)\approx0.5$ in the asymptotic regime $q\to\infty$.

physics.soc-ph↗

arXiv2013

Quantum Walks

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of processes (with rather different underlying dynamics) for producing random distributions. We discuss algorithmic applications for graph-searching and compare the two approaches. Next, we look at quantization of Markov chains and show how it can lead to speedups for sampling schemes. Finally, we turn to continuous time quantum walks and their applications, which provide interesting (even exponential) speedups over classical approaches.

quant-ph↗

arXiv2012

Quantum walks as a probe of structural anomalies in graphs

We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external vertices, are connected by edges. In the basic star graph, these are the only edges. If we now connect a subset of the external vertices to form a complete subgraph, a quantum walk can be used to find these vertices with a quantum speedup. Thus, under some circumstances, a quantum walk can be used to locate where the connectivity of a network changes. We also look at the case of two stars connected at one of their external vertices. A quantum walk can find the vertex shared by both graphs, again with a quantum speedup. This provides an example of using a quantum walk in order to find where two networks are connected. Finally, we use a quantum walk on a complete bipartite graph to find an extra edge that destroys the bipartite nature of the graph.

quant-ph↗

arXiv2012

Simulation of indivisible qubit channels in collision models

A sequence of controlled collisions between a quantum system and its environment (composed of a set of quantum objects) naturally simulates (with arbitrary precision) any Markovian quantum dynamics of the system under consideration. In this paper we propose and study the problem of simulation of an {\it arbitrary} quantum channel via collision models. We show that a correlated environment is capable to simulate {\it non-Markovian} evolutions leading to any indivisible qubit channel. In particular, we derive the corresponding master equation generating a continuous time non-Markovian dynamics implementing the universal NOT gate being an example of the most non-Markovian quantum channels.

quant-ph↗

arXiv2011

Toward protocols for quantum-ensured privacy and secure voting

We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see Phys. Lett. A 349, 75 (2006)] for protecting privacy in voting, and examine its security under certain types of attacks, in particular dishonest voters and external eavesdroppers. A variation of these quantum-based schemes can be used for multi-party function evaluation. We consider functions corresponding to group multiplication of $N$ group elements, with each element chosen by a different party. We show how quantum mechanics can be useful in maintaining the privacy of the choices group elements.

quant-ph↗

arXiv2011

Scavenging quantum information: Multiple observations of quantum systems

Given an unknown state of a qudit that has already been measured optimally, can one still extract any information about the original unknown state? Clearly, after a maximally informative measurement, the state of the system `collapses' into a post-measurement state from which the {\em{same}} observer cannot obtain further information about the original state of the system. However, the system still encodes a significant amount of information about the original preparation for a second observer who is unaware of the actions of the first one. We study how a series of independent observers can obtain, or scavenge, information about the unknown state of a system (quantified by the fidelity) when they sequentially measure it. We give closed-form expressions for the estimation fidelity, when one or several qudits are available to carry information about the single-qudit state, and study the `classical' limit when an arbitrarily large number of observers can obtain (nearly) complete information on the system. In addition to the case where all observers perform most informative measurements we study the scenario where a finite number of observers estimate the state with equal fidelity,regardless of their position in the measurement sequence; and the scenario where all observers use identical measurement apparata (up to a mutually unknown orientation) chosen so that a particular observer's estimation fidelity is maximized.

quant-ph↗

arXiv2010

Optimal unambiguous comparison of two unknown squeezed vacua

We propose a scheme for unambiguous state comparison (USC) of two unknown squeezed vacuum states of an electromagnetic field. Our setup is based on linear optical elements and photon-number detectors, and achieves optimal USC in an ideal case of unit quantum efficiency. In realistic conditions, i.e., for non-unit quantum efficiency of photodetectors, we evaluate the probability of getting an ambiguous result as well as the reliability of the scheme, thus showing its robustness in comparison to previous proposals.

quant-ph↗

arXiv2010

Finding structural anomalies in graphs by means of quantum walks

We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are $N$ spokes, we show that a quantum walk can find an extra edge connecting two of the spokes or a spoke with a loop on it in $O(\sqrt{N})$ steps. We initially find that if all of the spokes have loops except one, the walk will not find the spoke without a loop, but this can be fixed if we choose the phase with which the particle is reflected from the vertex without the loop. Consequently, quantum walks can, under some circumstances, be used to find structural anomalies in graphs.

quant-ph↗

arXiv2010

Efficient compression of quantum information

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. Using a quadratic number of elementary quantum gates we transform N identically prepared qubits into a state, which is nontrivial only on the first log(N+1) qubits. This procedure might be useful for quantum memories, as only a small portion of the original qubits has to be stored. Another possible application is in communicating a direction encoded in a set of quantum states, as the compressed state provides a high-effective method for such an encoding.

quant-ph↗

arXiv2009

Searching via walking: How to find a marked subgraph of a graph using quantum walks

We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation. The edges are marked by adding elements to them that impart a specific phase shift to the particle as it enters or leaves the edge. If the complete graph has N vertices and the subgraph has K vertices, the particle becomes localized on the subgraph in O(N/K) steps. This leads to a quantum search that is quadratically faster than a corresponding classical search. We show how to implement the quantum walk using a quantum circuit and a quantum oracle, which allows us to specify the resource needed for a quantitative comparison of the efficiency of classical and quantum searches -- the number of oracle calls.

quant-ph↗

arXiv2009

Scrutinizing single-qubit quantum channels: Theory and experiment with trapped ions

We report experimental implementation of various types of qubit channels using an individual trapped ion. We analyzed experimental data and we performed tomographic reconstruction of quantum channels based on these data. Specifically, we studied phase damping channels, where the damping acts either in the xy-plane of the Bloch sphere or in an arbitrary plane that includes the origin of the Bloch sphere. We also experimentally realized and consequently analyzed quantum channels that in addition to phase damping affect also a polarization rotation. We used three reconstruction schemes for estimation of quantum channels from experimental data: (1) a linear inverse method, (2) a maximum likelihood estimation, and (3) a constrained maximum likelihood estimation. We took into account realistic experimental conditions where imperfect test-state preparations and biased measurements are incorporated into the estimation schemes. As a result we found that imperfections present in the process of preparation of test states and as well as in measurements of the considered ion trap system do not limit the control of the implementation of the desired channel. Even imperfect preparation of test state and subsequent measurements still provide sufficient resources for the complete quantum-channel tomography.

quant-ph↗

arXiv2009

Quantum Machines

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 to machines that can perform a number of functions, with the function they perform being determined by a program, which is itself a quantum state. Examples of both deterministic and probabilistic programmable machines are given, and we conclude with a discussion of the utility of quantum programs.

quant-ph↗

arXiv2009

Quantum searches on highly symmetric graphs

We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of the vertices have the same scattering properties except for a subset of special vertices. The object of the search is to find a special vertex. A quantum circuit implementation of these walks is presented in which the set of special vertices is specified by a quantum oracle. We consider the complete graph, a complete bipartite graph, and an $M$-partite graph. In all cases, the dimension of the Hilbert space in which the time evolution of the walk takes place is small (between three and six), so the walks can be completely analyzed analytically. Such dimensional reduction is due to the fact that these graphs have large automorphism groups. We find the usual quadratic quantum speedups in all cases considered.

quant-ph↗

arXiv2009

Unambiguous identification of coherent states II: Multiple resources

We consider unambiguous identification of coherent states of electromagnetic field. In particular, we study possible generalizations of an optical setup proposed in M. Sedlák {\it et al.}, Phys. Rev. A {\bf 76}, 022326 (2007). We show how the unambiguous identification of coherent states can be performed in a general case when multiple copies of unknown and the reference states are available. We also investigate whether reference states after the measurement can be "recovered" and further used for subsequent unambiguous identification tasks. We show that in spite of the fact that the recovered reference states are disturbed by measurements they can be repeatedly used for unambiguous identifications. We analyze the role of various imperfections in preparation of the unknown and the reference coherent states on the performance of our unambiguous identification setup.

quant-ph↗

arXiv2007

Quantum homogenization and state randomization in semi-quantal spin systems

We investigate dynamics of semi-quantal spin systems in which quantum bits are attached to classically and possibly stochastically moving classical particles. The interaction between the quantum bits takes place when the respective classical particles get close to each other in space. We find that with Heisenberg XX couplings quantum homogenization takes place after a time long enough, regardless of the details of the underlying classical dynamics. This is accompanied by the development of a stationary bipartite entanglement. If the information on the details of the motion of a stochastic classical system is disregarded, the stationary state of the whole quantum subsystem is found to be a complete mixture in the studied cases, though the transients depend on the properties of the classical motion.

quant-ph↗

arXiv2007

Unambiguous comparison of ensembles of quantum states

We present a solution of the problem of the optimal unambiguous comparison of two ensembles of unknown quantum states (psi_1)^k and (psi_2)^l. We consider two cases: 1) The two unknown states psi_1 and psi_2 are arbitrary states of qudits. 2) Alternatively, they are coherent states of a harmonic oscillator. For the case of coherent states we propose a simple experimental realization of the optimal "comparison" machine composed of a finite number of beam-splitters and a single photodetector.

quant-ph↗

arXiv2007

Application of quantum algorithms to the study of permutations and group automorphisms

We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to $Aut(Z_{p})$ where $p$ is prime. The remaining two make use of modifications of the Grover search algorithm. The first finds the fixed point of a permutation or an automorphism (assuming it has only one besides the identity). It can be generalized to find cycles of a specified size for permutations or orbits of a specified size for automorphisms. The second finds which of a set of permutations or automorphisms maps one particular element of a set or group onto another. This has relevance to the conjugacy problem for groups. We show how two of these algorithms can be implemented via programmable quantum processors. This approach opens new perspectives in quantum information processing, wherein both the data and the programs are represented by states of quantum registers. In particular, quantum programs that specify control over data can be treated using methods of quantum information theory.

quant-ph↗

arXiv2007

Recycling of quantum information: Multiple observations of quantum systems

Given a finite number of copies of an unknown qubit state that have already been measured optimally, can one still extract any information about the original unknown state? We give a positive answer to this question and quantify the information obtainable by a given observer as a function of the number of copies in the ensemble, and of the number of independent observers that, one after the other, have independently measured the same ensemble of qubits before him. The optimality of the protocol is proven and extensions to other states and encodings are also studied. According to the general lore, the state after a measurement has no information about the state before the measurement. Our results manifestly show that this statement has to be taken with a grain of salt, specially in situations where the quantum states encode confidential information.

quant-ph↗