Dimensional-scaling estimate of the energy of a large system from that of its building blocks: Hubbard model and Fermi liquid

A simple, physically motivated, scaling hypothesis, which becomes exact in important limits, yields estimates for the ground-state energy of large, composed, systems in terms of the ground-state energy of its building blocks. The concept is illustrated for the electron liquid, and the Hubbard model. By means of this scaling argument the energy of the one-dimensional half-filled Hubbard model is estimated from that of a 2-site Hubbard dimer, obtaining quantitative agreement with the exact one-dimensional Bethe-Ansatz solution, and the energies of the two- and three-dimensional half-filled Hubbard models are estimated from the one-dimensional energy, recovering exact results for $U\to 0$ and $U\to \infty$ and coming close to Quantum Monte Carlo data for intermediate $U$.Comment: 3 figure

Entanglement versus mixedness for coupled qubits under a phase damping channel

Quantification of entanglement against mixing is given for a system of coupled qubits under a phase damping channel. A family of pure initial joint states is defined, ranging from pure separable states to maximally entangled state. An ordering of entanglement measures is given for well defined initial state amount of entanglement.Comment: 9 pages, 2 figures. Replaced with final published versio

State reconstruction of finite dimensional compound systems via local projective measurements and one-way classical communication

For a finite dimensional discrete bipartite system, we find the relation between local projections performed by Alice, and Bob post-selected state dependence on the global state submatrices. With this result the joint state reconstruction problem for a bipartite system can be solved with strict local projections and one-way classical communication. The generalization to multipartite systems is straightforward.Comment: 4 pages, 1 figur

O DNA do cafezinho brasileiro.

bitstream/item/29067/1/2010-299.pd

A Flexible Implementation of a Matrix Laurent Series-Based 16-Point Fast Fourier and Hartley Transforms

This paper describes a flexible architecture for implementing a new fast computation of the discrete Fourier and Hartley transforms, which is based on a matrix Laurent series. The device calculates the transforms based on a single bit selection operator. The hardware structure and synthesis are presented, which handled a 16-point fast transform in 65 nsec, with a Xilinx SPARTAN 3E device.Comment: 4 pages, 4 figures. IEEE VI Southern Programmable Logic Conference 201