Search results for " Computer Science"
showing 10 items of 3983 documents
Quantum Finite State Transducers
2000
We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their `little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.
Searching for exceptional points and inspecting non-contractivity of trace distance in (anti-) PT -symmetric systems
2022
Non-Hermitian systems with parity-time ($\mathcal{PT}$) symmetry and anti-$\mathcal{PT}$ symmetry give rise to exceptional points (EPs) with intriguing properties related to, e.g., chiral transport and enhanced sensitivity, due to the coalescence of eigenvectors. In this paper, we propose a powerful and easily computable tool, based on the Hilbert-Schmidt speed (HSS), which does not require the diagonalization of the evolved density matrix, to detect exactly the EPs and hence the critical behavior of the (anti-)$\mathcal{PT}\!-$symmetric systems, especially high-dimensional ones. Our theoretical predictions, made without the need for modification of the Hilbert space, which is performed by …
Distributed construction of quantum fingerprints
2003
Quantum fingerprints are useful quantum encodings introduced by Buhrman, Cleve, Watrous, and de Wolf (Physical Review Letters, Volume 87, Number 16, Article 167902, 2001; quant-ph/0102001) in obtaining an efficient quantum communication protocol. We design a protocol for constructing the fingerprint in a distributed scenario. As an application, this protocol gives rise to a communication protocol more efficient than the best known classical protocol for a communication problem.
Diagrammatic approach to quantum search
2014
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory's effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with $N$.
Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
2015
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we analytically solve search on the "simplex of $K_M$ complete graphs" with all configurations of two marked vertices, two configurations of $M+1$ marked vertices, and two configurations of $2(M+1)$ marked vertices, showing that the location of the marked vertices can dramatically influence the required jumping rate of the quantum walk, such that using the wrong configuration's value can cause the search to fail. This sensitivity to the jumping rate is an is…
Quantum chemical meta-workflows in MoSGrid
2014
Quantum chemical workflows can be built up within the science gateway Molecular Simulation Grid. Complex workflows required by the end users are dissected into smaller workflows that can be combined freely to larger meta-workflows. General quantum chemical workflows are described here as well as the real use case of a spectroscopic analysis resulting in an end-user desired meta-workflow. All workflow features are implemented via Web Services Parallel Grid Runtime and Developer Environment and submitted to UNICORE. The workflows are stored in the Molecular Simulation Grid repository and ported to the SHIWA repository. © 2014 John Wiley & Sons, Ltd.
Quantum-chemical simulations of free and bound hole polarons in corundum crystal
1997
Abstract The semi-empirical method of the so-called intermediate neglect of differential overlap (INDO) has been applied to the calculations of the hole small-radius polarons in corundum crystals. Results for optimized atomic and electronic structure using two different approaches (the molecular cluster and periodic, supercell model) are critically compared. It is shown that the main results are similar in both cases.
Lattice quantum hadrodynamics on a CRAY Y-MP
1992
Quantum corrections to the mean-field equation of state for nuclear matter are estimated in a lattice simulation of quantum hadrodynamics on a CRAY Y-MP. In contrast with lattice quantum chromodynamics, where coordinate space methods are the standard, the calculations are carried out in momentum space and on nonhypercubic (irregular) lattices. The quantum corrections to the known, mean-field equation of state were found to be considerable. The time frame of the project and the large computational needs of the program required the use of powerful supercomputers, like the CRAY Y-MP, which are capable of performing at a very high computing speed by using both vector and parallel hardware, the …
Quantum Computing with Trapped Charged Particles
2009
The concept of quantum computing has no clear cut origin. It emerged from combinations of information theory and quantum mechanical concepts. A decisive step was taken by Feynman [414, 415] who considered the possibility of universal simulation, a quantum system which could simulate the physical behavior of any other. Feynman gave arguments which suggested that quantum evolution could be used to compute certain problems more efficiently than any classical computer. His device may be considered as not sufficiently specified to be called a computer. The next important step was taken in 1985 by Deutsch [310]. His proposal is generally considered to represent the first blueprint for a quantum c…
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
2015
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …