In quantum computing the decoherence time of qubits determines computation available and this is very limited when using current hardware. paper we minimize execution (the depth) for a class circuits referred to as linear reversible circuits, which has many applications in (e.g., stabilizer CNOT+T etc.). We propose practical formulation divide conquer algorithm that produces are twice shallow t...

Abstract. We propose a new cloud screening method for sun photometry that is designed to effectively filter thin clouds. Our based on k-nearest-neighbour algorithm instead of scanning time series aerosol optical depth. Using 10 years data from precision radiometer in Innsbruck, we compare our and the currently employed technique. exemplify performance two routines different conditions. While bo...

Unitary coupled cluster (UCC) approaches are an appealing route to utilizing quantum hardware perform chemistry calculations, as computers can in principle UCC calculations a polynomially scaling fashion, compared with the exponential required on classical computers. Current noisy intermediate scale limited by both capacity number of logical qubits and noise introduced deep circuits for using v...

In this paper we present the class of general logic programs which has a special kind of stratiications, called the locally nite stratiication. For the class, good properties of propositional logic programs, such as termination and safeness, are preserved. Using these properties, we show the completeness of a kind of SLDNF-resolution that use a depth bound, called depth bounded resolution, with...

In this paper we address the possibility to improve the reliability of small to middle-size circuits without employing redundancy. Circuits’ reliability is improved by reducing the logic depth of critical paths since the probability of failure of each output of the circuit depends no the logic depth of critical paths. Circuits of the same size were considered, as well as different synthesized v...