Search results for "TheoryofComputation_GENERAL"
showing 10 items of 106 documents
Quantum autoencoders via quantum adders with genetic algorithms
2017
The quantum autoencoder is a recent paradigm in the field of quantum machine learning, which may enable an enhanced use of resources in quantum technologies. To this end, quantum neural networks with less nodes in the inner than in the outer layers were considered. Here, we propose a useful connection between quantum autoencoders and quantum adders, which approximately add two unknown quantum states supported in different quantum systems. Specifically, this link allows us to employ optimized approximate quantum adders, obtained with genetic algorithms, for the implementation of quantum autoencoders for a variety of initial states. Furthermore, we can also directly optimize the quantum autoe…
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…
Coins Make Quantum Walks Faster
2004
We show how to search N items arranged on a $\sqrt{N}\times\sqrt{N}$ grid in time $O(\sqrt N \log N)$, using a discrete time quantum walk. This result for the first time exhibits a significant difference between discrete time and continuous time walks without coin degrees of freedom, since it has been shown recently that such a continuous time walk needs time $\Omega(N)$ to perform the same task. Our result furthermore improves on a previous bound for quantum local search by Aaronson and Ambainis. We generalize our result to 3 and more dimensions where the walk yields the optimal performance of $O(\sqrt{N})$ and give several extensions of quantum walk search algorithms for general graphs. T…
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
Politics and Procurement: Evidence from Cleaning Contracts
2007
We study the effects of politics on public procurement in Swedish municipalities in 199098 using data on cleaning services. No procuring municipality committed to a standard auction format or to an ...
THE SHAPLEY-SOLIDARITY VALUE FOR GAMES WITH A COALITION STRUCTURE
2013
A value for games with a coalition structure is introduced, where the rules guiding cooperation among the members of the same coalition are different from the interaction rules among coalitions. In particular, players inside a coalition exhibit a greater degree of solidarity than they are willing to use with players outside their coalition. The Shapley value is therefore used to compute the aggregate payoffs for the coalitions, and the solidarity value to obtain the payoffs for the players inside each coalition.
The combinatorics of the SU(2) black hole entropy in loop quantum gravity
2009
We use the combinatorial and number-theoretical methods developed in previous work by the authors to study black hole entropy in the new proposal put forward by Engle, Noui and Perez. Specifically we give the generating functions relevant for the computation of the entropy and use them to derive its asymptotic behavior including the value of the Immirzi parameter and the coefficient of the logarithmic correction.
Combinatorics of the SU(2) black hole entropy in loop quantum gravity
2009
We use the combinatorial and number-theoretical methods developed in previous works by the authors to study black hole entropy in the new proposal put forth by Engle, Noui, and Perez. Specifically, we give the generating functions relevant for the computation of the entropy and use them to derive its asymptotic behavior, including the value of the Immirzi parameter and the coefficient of the logarithmic correction.
Effect of Mastiha supplementation on NAFLD: The MAST4HEALTH Randomised, Controlled Trial
2021
On behalf of MAST4HEALTH consortium: et al.