Search results for "ComputerSystemsOrganization_MISCELLANEOUS"

Classical and Quantum Annealing in the Median of Three Satisfiability

2011

We determine the classical and quantum complexities of a specific ensemble of three-satisfiability problems with a unique satisfying assignment for up to N = 100 and 80 variables, respectively. In the classical limit, we employ generalized ensemble techniques and measure the time that a Markovian Monte Carlo process spends in searching classical ground states. In the quantum limit, we determine the maximum finite correlation length along a quantum adiabatic trajectory determined by the linear sweep of the adiabatic control parameter in the Hamiltonian composed of the problem Hamiltonian and the constant transverse field Hamiltonian. In the median of our ensemble, both complexities diverge e…

New Developments in Quantum Algorithms

2010

In this survey, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O(\sqrt{N}). This provides quantum speedups for any problem that can be expressed via Boolean formulas. This result can be also extended to span problems, a generalization of Boolean formulas. This provides an optimal quantum algorithm for any Boolean function in the black-box query model. The second new development is a quantum algorithm for solving systems of linear equations. In contrast with traditional algorithms that run in time O(N^{2.37...}) where N is the size of the system, the …

Quantum property testing for bounded-degree graphs

2010

We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph s…

Automata and Quantum Computing

2015

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity

Supervised Quantum Learning without Measurements

2017

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies. The…

A pre-processing and network analysis of GPS tracking data

2020

Global Positioning System (GPS) devices afford the opportunity to collect accurate data on unit movements from temporal and spatial perspectives. With a special focus on GPS technology in travel surveys, this paper proposes: (1) two algorithms for the pre-processing of GPS data in order to deal with outlier identification and missing data imputation; (2) a clustering approach to recover the main points of interest from GPS trajectories; and (3) a weighted-directed network, which incorporates the most relevant characteristics of the GPS trajectories at an aggregate level. A simulation study shows the goodness-of-fit of the imputation data algorithm and the robustness of the clustering algori…

Mathematical logic and quantum finite state automata

2009

AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented.

The “I” between G and C: E-Government intermediaries in developing countries

2011

Published version of an article from the journal: The Electronic Journal of Information Systems in Developing Countries. Also available from the publisher: http://www.ejisdc.org/Ojs2/index.php/ejisdc/article/viewFile/826/371 While there has been a rapid growth in e-Government initiatives in developing countries, whether it has led to providing effective government services to the citizens has remained a question of concern. Evidence suggests that this objective is far from being met. The main hurdle has been that an overwhelming part of the citizens in these countries do not have the capability to either access government information physically or to use it effectively even when they can ac…

2019

This paper contributes to e-government research by presenting a review and discussion on how digitalization of public services has affected the interaction between citizens and government. We argue ...

Political Participation and Democracy in the Information Age: Effects of ICT-Based Communication Forms between the Authorities and the Citizens on Tr…

2009

Bidrag på konferanse: The Third International Conference on Digital Society ICDS 2009 1-7 February 2009 Cancun, Mexico The main trends concerning the traditional channels of participation are reduced voting turnout, reduced participation in political parties, stable participation in associations and increased citizen contact. The influence of ICT based form of communication on the relations between the authorities and the citizens are heavily influenced by the role of the citizens designed by the authorities. If the citizens are treated as customers the authorities are pursuing a consultative model focusing on creating an effective administration. The flow of information is uni linear; howe…