998 resultados para Quantum algorithms


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The spectral properties and phase diagram of the exactly integrable spin-1 quantum chain introduced by Alcaraz and Bariev are presented. The model has a U(1) symmetry and its integrability is associated with an unknown R-matrix whose dependence on the spectral parameters is not of a different form. The associated Bethe ansatz equations that fix the eigenspectra are distinct from those associated with other known integrable spin models. The model has a free parameter t(p). We show that at the special point t(p) = 1, the model acquires an extra U(1) symmetry and reduces to the deformed SU(3) Perk-Schultz model at a special value of its anisotropy q = exp(i2 pi/3) and in the presence of an external magnetic field. Our analysis is carried out either by solving the associated Bethe ansatz equations or by direct diagonalization of the quantum Hamiltonian for small lattice sizes. The phase diagram is calculated by exploring the consequences of conformal invariance on the finite-size corrections of the Hamiltonian eigenspectrum. The model exhibits a critical phase ruled by the c = 1 conformal field theory separated from a massive phase by first-order phase transitions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the influence of ferromagnetic and antiferromagnetic bond defects on the ground-state energy of antiferromagnetic spin chains. In the absence of translational invariance, the energy spectrum of the full Hamiltonian is obtained numerically, by an iterative modi. cation of the power algorithm. In parallel, approximate analytical energies are obtained from a local-bond approximation, proposed here. This approximation results in significant improvement upon the mean-field approximation, at negligible extra computational effort. (C) 2008 Published by Elsevier B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article reports a relaxation study in an oriented system containing spin 3/2 nuclei using quantum state tomography (QST). The use of QST allowed evaluating the time evolution of all density matrix elements starting from several initial states. Using an appropriated treatment based on the Redfield theory, the relaxation rate of each density matrix element was measured and the reduced spectral densities that describe the system relaxation were determined. All the experimental data could be well described assuming pure quadrupolar relaxation and reduced spectral densities corresponding to a superposition of slow and fast motions. The data were also analyzed in the context of Quantum Information Processing, where the coherence loss of each qubit of the system was determined using the partial trace operation. (C) 2008 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

NMR quantum information processing studies rely on the reconstruction of the density matrix representing the so-called pseudo-pure states (PPS). An initially pure part of a PPS state undergoes unitary and non-unitary (relaxation) transformations during a computation process, causing a ""loss of purity"" until the equilibrium is reached. Besides, upon relaxation, the nuclear polarization varies in time, a fact which must be taken into account when comparing density matrices at different instants. Attempting to use time-fixed normalization procedures when relaxation is present, leads to various anomalies on matrices populations. On this paper we propose a method which takes into account the time-dependence of the normalization factor. From a generic form for the deviation density matrix an expression for the relaxing initial pure state is deduced. The method is exemplified with an experiment of relaxation of the concurrence of a pseudo-entangled state, which exhibits the phenomenon of sudden death, and the relaxation of the Wigner function of a pseudo-cat state.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we present a novel approach for multispectral image contextual classification by combining iterative combinatorial optimization algorithms. The pixel-wise decision rule is defined using a Bayesian approach to combine two MRF models: a Gaussian Markov Random Field (GMRF) for the observations (likelihood) and a Potts model for the a priori knowledge, to regularize the solution in the presence of noisy data. Hence, the classification problem is stated according to a Maximum a Posteriori (MAP) framework. In order to approximate the MAP solution we apply several combinatorial optimization methods using multiple simultaneous initializations, making the solution less sensitive to the initial conditions and reducing both computational cost and time in comparison to Simulated Annealing, often unfeasible in many real image processing applications. Markov Random Field model parameters are estimated by Maximum Pseudo-Likelihood (MPL) approach, avoiding manual adjustments in the choice of the regularization parameters. Asymptotic evaluations assess the accuracy of the proposed parameter estimation procedure. To test and evaluate the proposed classification method, we adopt metrics for quantitative performance assessment (Cohen`s Kappa coefficient), allowing a robust and accurate statistical analysis. The obtained results clearly show that combining sub-optimal contextual algorithms significantly improves the classification performance, indicating the effectiveness of the proposed methodology. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work we applied a quantum circuit treatment to describe the nuclear spin relaxation. From the Redfield theory, we obtain a description of the quadrupolar relaxation as a computational process in a spin 3/2 system, through a model in which the environment is comprised by five qubits and three different quantum noise channels. The interaction between the environment and the spin 3/2 nuclei is described by a quantum circuit fully compatible with the Redfield theory of relaxation. Theoretical predictions are compared to experimental data, a short review of quantum channels and relaxation in NMR qubits is also present.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Structural and conformational properties of 1H-Isoindole-1,3(2H)-dione, 2-[(methoxycarbonyl)thio] (S-phthalimido O-methyl thiocarbonate) are analyzed using a combined approach including X-ray diffraction, vibrational spectra and theoretical calculation methods. The vibrational properties have been studied by infrared and Raman spectroscopies along with quantum chemical calculations (B3LYP and B3PW91 functional in connection with the 6-311++G** and aug-cc-pVDZ basis sets). The crystal structure was determined by X-ray diffraction methods. The substance crystallizes in the monoclinic P2(1)/c space group with a = 6.795(1), b = 5.109(1), c = 30.011(3) angstrom, beta = 90.310(3)degrees and Z = 4 molecules per unit cell. The conformation adopted by the N-S-C=O group is syn (C=O double bond in synperiplanar orientation with respect to the N-S single bond). The experimental molecular structure is well reproduced by the MP2/aug-cc-pVDZ method. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

As a laboratory for loop quantum gravity, we consider the canonical quantization of the three-dimensional Chern-Simons theory on a noncompact space with the topology of a cylinder. Working within the loop quantization formalism, we define at the quantum level the constraints appearing in the canonical approach and completely solve them, thus constructing a gauge and diffeomorphism invariant physical Hilbert space for the theory. This space turns out to be infinite dimensional, but separable.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A very high level of theoretical treatment (complete active space self-consistent field CASSCF/MRCI/aug-cc-pV5Z) was used to characterize the spectroscopic properties of a manifold of quartet and doublet states of the species BeP, as yet experimentally unknown. Potential energy curves for 11 electronic states were obtained, as well as the associated vibrational energy levels, and a whole set of spectroscopic constants. Dipole moment functions and vibrationally averaged dipole moments were also evaluated. Similarities and differences between BeN and BeP were analysed along with the isovalent SiB species. The molecule BeP has a X (4)Sigma(-) ground state, with an equilibrium bond distance of 2.073 angstrom, and a harmonic frequency of 516.2 cm(-1); it is followed closely by the states (2)Pi (R(e) = 2.081 angstrom, omega(e) = 639.6 cm(-1)) and (2)Sigma(-) (R(e) = 2.074 angstrom, omega(e) = 536.5 cm(-1)), at 502 and 1976 cm(-1), respectively. The other quartets investigated, A (4)Pi (R(e) = 1.991 angstrom, omega(e) = 555.3 cm(-1)) and B (4)Sigma(-) (R(e) = 2.758 angstrom, omega(e) = 292.2 cm(-1)) lie at 13 291 and 24 394 cm(-1), respectively. The remaining doublets ((2)Delta, (2)Sigma(+)(2) and (2)Pi(3)) all fall below 28 000 cm(-1). Avoided crossings between the (2)Sigma(+) states and between the (2)Pi states add an extra complexity to this manifold of states.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dideprotonation of 4-(4-nitrophenylazo)resorcinol generates an anionic species with substantial electronic pi delocalization. As compared to the parent neutral species, the anionic first excited electronic transition, characterized as an intramolecular charge transfer (ICT) from the CO(-) groups to the NO(2) moiety, shows a drastic red shift of ca. 200 nm in the lambda(max) in the UV-vis spectrum, leading to one of the lowest ICT energies observed (lambda(max) = 630 nm in dimethyl sulfoxide (DMSO)) in this class of push-pull molecular systems. Concomitantly, a threefold increase in the molar absorptivity (epsilon(max)) in comparison to the neutral species is observed. The resonance Raman enhancement profiles reveal that in the neutral species the chromophore involves several modes, as nu(C-N), nu(N=N), nu(C=C) and nu(s)(NO(2)), whereas in the dianion, there is a selective enhancement of the NO(2) vibrational modes. The quantum chemical calculations of the electronic transitions and vibrational wavenumbers led to a consistent analysis of the enhancement patterns observed in the resonance Raman spectra. Copyright (C) 2009 John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The protonation effect on the vibrational and electronic spectra of 4-aminoazobenzene and 4-(dimethylamino)azobenzene was investigated by resonance Raman spectroscopy, and the results were discussed on the basis of quantum-chemical calculations. Although this class of molecular systems has been investigated in the past concerning the azo-hydrazone tautomerism, the present work is the first to use CASSCF/CASPT2 calculations to unveil the structure of both tautomers as well the nature of the molecular orbitals involved in chromophoric moieties responsible for the resonance Raman enhancement patterns. More specifically both the resonance Raman and theoretical results show clearly that in the neutral species, the charge transfer transition involves mainly the azo moiety, whereas in the protonated forms there is a great difference, depending on the tautomer. In fact, for the azo tautomer the transition is similar to that observed in the corresponding neutral species, whereas in the hydrazone tautomer such a transition is much more delocalized due to the contribution of the quinoid structure. The characterization of protonated species and the understanding of the tautomerization mechanism are crucial for controlling molecular properties depending on the polarity and pH of the medium.