52 resultados para superposition
Resumo:
This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical computers (C++) and quantum computers (QCL). The algorithms were submitted to simulations, which resulted in a comparative study of the operation of Grover’s algorithm on both systems, carrying out searches in a mass of data in XML format files. As a result, we see very similar numbers between classical and quantum systems, this creates an expectation that the search in real quantum computers is much more efficient.
Resumo:
This paper presents an analysis of the short story Passeio Noturno I, by Rubens Fonseca, from the gerative way of sense, oriented by Greimas´ postulations of generative semiotics. For the semiotics, discourse is conceived as a superposition of levels of diferent depth which are articulated according to a way which goes from the abstract to the concrete (BARROS, 2001). Following the notion of gerative way, the analysis of the short story is three folded: the level of fundamental structures, the level of the narrative structures and the level of the discursive structures. The subject matter that underlies the structure of the short story refers to a critique of the violence present in capitalist society in which "voices of culture" coexist with "voices of barbarie".
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
There is little information regarding bond strengths of polyglass to metal alloys. This study evaluated the influence of bonding system on shear bond strength of a composite resin (Artglass/Heraeus Kulzer) to cast titanium (Ti). Twenty metallic structures (4mm in diameter, 5mm thick) of titanium grade I were cast shaped and abraded with 250mm aluminum oxide and separated into two groups. For each group was applied one bonding system (Siloc or Retention Flow) before opaque and dentin polymer superposition. This procedure was managed using teflon matrices. They were manipulated and polymerized according to the manufacturer's recommendations. The samples were stored in distilled water for 24 hours at 37º and thermocycled (5º and 55ºC/500 cycles). Shear bond strength tests were performed by using an Instron Universal testing machine at a crosshead speed of 5mm/min. Results were analyzed statistically with one-way ANOVA (a=0,5) and they indicated that the Retention Flow system was statistically better than Siloc (20.74 MPa and 11.65 MPa , respectively). It was possible to conclude that the bonding agent influenced the adhesion between polymer and cast titanium.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
This paperaims to determine the velocity profile, in transient state, for a parallel incompressible flow known as Couette flow. The Navier-Stokes equations were applied upon this flow. Analytical solutions, based in Fourier series and integral transforms, were obtained for the one-dimensional transient Couette flow, taking into account constant and time-dependent pressure gradients acting on the fluid since the same instant when the plate starts it´s movement. Taking advantage of the orthogonality and superposition properties solutions were foundfor both considered cases. Considering a time-dependent pressure gradient, it was found a general solution for the Couette flow for a particular time function. It was found that the solution for a time-dependent pressure gradient includes the solutions for a zero pressure gradient and for a constant pressure gradient.
Resumo:
This undergraduate thesis aims formally define aspects of Quantum Turing Machine using as a basis quantum finite automata. We introduce the basic concepts of quantum mechanics and quantum computing through principles such as superposition, entanglement of quantum states, quantum bits and algorithms. We demonstrate the Bell's teleportation theorem, enunciated in the form of Deutsch-Jozsa definition for quantum algorithms. The way as the overall text were written omits formal aspects of quantum mechanics, encouraging computer scientists to understand the framework of quantum computation. We conclude our thesis by listing the Quantum Turing Machine's main limitations regarding the well-known Classical Turing Machines