2,550 research outputs found
Decoherent quantum walks driven by a generic coin operation
We consider the effect of different unitary noise mechanisms on the evolution
of a quantum walk (QW) on a linear chain with a generic coin operation: (i)
bit-flip channel noise, restricted to the coin subspace of the QW, and (ii)
topological noise caused by randomly broken links in the linear chain.
Similarities and differences in the respective decoherent dynamics of the
walker as a function of the probability per unit time of a decoherent event
taking place are discussed
Applications of active microwave imagery
The following topics were discussed in reference to active microwave applications: (1) Use of imaging radar to improve the data collection/analysis process; (2) Data collection tasks for radar that other systems will not perform; (3) Data reduction concepts; and (4) System and vehicle parameters: aircraft and spacecraft
Active microwave users working group program planning
A detailed programmatic and technical development plan for active microwave technology was examined in each of four user activities: (1) vegetation; (2) water resources and geologic applications, and (4) oceanographic applications. Major application areas were identified, and the impact of each application area in terms of social and economic gains were evaluated. The present state of knowledge of the applicability of active microwave remote sensing to each application area was summarized and its role relative to other remote sensing devices was examined. The analysis and data acquisition techniques needed to resolve the effects of interference factors were reviewed to establish an operational capability in each application area. Flow charts of accomplished and required activities in each application area that lead to operational capability were structured
Optimal discrimination of quantum operations
We address the problem of discriminating with minimal error probability two
given quantum operations. We show that the use of entangled input states
generally improves the discrimination. For Pauli channels we provide a complete
comparison of the optimal strategies where either entangled or unentangled
input states are used.Comment: 4 pages, no figure
Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
What is the simplest Hamiltonian which can implement quantum computation
without requiring any control operations during the computation process? In a
previous paper we have constructed a 10-local finite-range interaction among
qubits on a 2D lattice having this property. Here we show that
pair-interactions among qutrits on a 2D lattice are sufficient, too, and can
also implement an ergodic computer where the result can be read out from the
time average state after some post-selection with high success probability.
Two of the 3 qutrit states are given by the two levels of a spin-1/2 particle
located at a specific lattice site, the third state is its absence. Usual
hopping terms together with an attractive force among adjacent particles induce
a coupled quantum walk where the particle spins are subjected to spatially
inhomogeneous interactions implementing holonomic quantum computing. The
holonomic method ensures that the implemented circuit does not depend on the
time needed for the walk.
Even though the implementation of the required type of spin-spin interactions
is currently unclear, the model shows that quite simple Hamiltonians are
powerful enough to allow for universal quantum computing in a closed physical
system.Comment: More detailed explanations including description of a programmable
version. 44 pages, 12 figures, latex. To appear in PR
Quantum walks can find a marked element on any graph
We solve an open problem by constructing quantum walks that not only detect
but also find marked vertices in a graph. In the case when the marked set
consists of a single vertex, the number of steps of the quantum walk is
quadratically smaller than the classical hitting time of any
reversible random walk on the graph. In the case of multiple marked
elements, the number of steps is given in terms of a related quantity
which we call extended hitting time.
Our approach is new, simpler and more general than previous ones. We
introduce a notion of interpolation between the random walk and the
absorbing walk , whose marked states are absorbing. Then our quantum walk
is simply the quantum analogue of this interpolation. Contrary to previous
approaches, our results remain valid when the random walk is not
state-transitive. We also provide algorithms in the cases when only
approximations or bounds on parameters (the probability of picking a
marked vertex from the stationary distribution) and are
known.Comment: 50 page
Single-qubit unitary gates by graph scattering
We consider the effects of plane-wave states scattering off finite graphs, as
an approach to implementing single-qubit unitary operations within the
continuous-time quantum walk framework of universal quantum computation. Four
semi-infinite tails are attached at arbitrary points of a given graph,
representing the input and output registers of a single qubit. For a range of
momentum eigenstates, we enumerate all of the graphs with up to vertices
for which the scattering implements a single-qubit gate. As increases, the
number of new unitary operations increases exponentially, and for the
majority correspond to rotations about axes distributed roughly uniformly
across the Bloch sphere. Rotations by both rational and irrational multiples of
are found.Comment: 8 pages, 7 figure
Study of Pressurization Systems for Liquid Propulsion Rocket Engines Final Report, 19 Apr. 1961 - 15 Sep. 1962
Selection technique to determine most suitable liquid propellant pressurization systems for various space mission
Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs
In this paper, we present a quantum algorithm for dynamic programming
approach for problems on directed acyclic graphs (DAGs). The running time of
the algorithm is , and the running time of the
best known deterministic algorithm is , where is the number of
vertices, is the number of vertices with at least one outgoing edge;
is the number of edges. We show that we can solve problems that use OR,
AND, NAND, MAX and MIN functions as the main transition steps. The approach is
useful for a couple of problems. One of them is computing a Boolean formula
that is represented by Zhegalkin polynomial, a Boolean circuit with shared
input and non-constant depth evaluating. Another two are the single source
longest paths search for weighted DAGs and the diameter search problem for
unweighted DAGs.Comment: UCNC2019 Conference pape
Robustness of adiabatic quantum computation
We study the fault tolerance of quantum computation by adiabatic evolution, a
quantum algorithm for solving various combinatorial search problems. We
describe an inherent robustness of adiabatic computation against two kinds of
errors, unitary control errors and decoherence, and we study this robustness
using numerical simulations of the algorithm.Comment: 11 pages, 5 figures, REVTe
- …