Related papers: Moore machines duality
The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for conjectures. The minimum number of states in which a conjecture can be modeled gives a classification of what logic…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
In this paper, we present experimental algorithms for solving the dualization problem. We present the results of extensive experimentation comparing the execution time of various algorithms.
Quantum cloning machine for arbitrary mixed states in symmetric subspace is proposed. This quantum cloning machine can be used to copy part of the output state of another quantum cloning machine and is useful in quantum computation and…
Given two unsorted lists each of length N that have a single common entry, a quantum computer can find that matching element with a work factor of $O(N^{3/4}\log N)$ (measured in quantum memory accesses and accesses to each list). The…
The Thue-Morse set $\mathcal{T}$ is the set of those non-negative integers whose binary expansions have an even number of $1$. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word…
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
Given two sets A and B and two oracles O(A) and O(B) that can identify the elements of these sets respectively, the goal is to find an element common to both sets using minimum number of oracle queries. Each application of either O(A) or…
We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for linear convergence to a zero of a maximal…
In this paper we consider a distributed optimization scenario in which a set of processors aims at cooperatively solving a class of min-max optimization problems. This set-up is motivated by peak-demand minimization problems in smart grids.…
Quantum algorithms often assume independent spin qubits to produce trivial $|\uparrow\rangle=|0\rangle$, $|\downarrow\rangle=|1\rangle$ mappings. This can be unrealistic in many solid-state implementations with sizeable magnetic…
To promote the global search ability of the original state transition algorithm, a new operator called axesion is suggested, which aims to search along the axes and strengthen single dimensional search. Several benchmark minimization…
We describe a quantum computer based upon the coherent manipulation of two-level atoms between discrete one-dimensional momentum states. Combinations of short laser pulses with kinetic energy dependent free phase evolution can perform the…
A coherent state representation of the expectation value of an arbitrary (but still polynomial) normal ordered quantum operator is discussed. This serves as a basis for developing a fast and easy-to-handle algorithm, based on series of…
In this work, we characterize the existence of solution for a certain variational inequality by means of a classical minimax theorem. In addition, we propose a numerical algorithm for the solution of an inverse problem associated with a…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
In various areas of computer science, we deal with a set of constraints to be satisfied. If the constraints cannot be satisfied simultaneously, it is desirable to identify the core problems among them. Such cores are called minimal…
It is possible to reduce some types of quantum computation errors by symmetrizing the quantum state of a redundant array. Various models are discussed.
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…
We give out a proposal of quantum simulation of pairing model on an NMR quantum computer. In our proposal, we choose an appropriate initial state which can be easily prepared in experiment. Making use of feature of NMR measure and the…