Entanglement and boundary critical phenomena

We investigate boundary critical phenomena from a quantum-information perspective. Bipartite entanglement in the ground state of one-dimensional quantum systems is quantified using the Renyi entropy S-alpha, which includes the von Neumann entropy (alpha -> 1) and the single-copy entanglement (alpha ->infinity) as special cases. We identify the contribution of the boundaries to the Renyi entropy, and show that there is an entanglement loss along boundary renormalization group (RG) flows. This property, which is intimately related to the Affleck-Ludwig g theorem, is a consequence of majorization relations between the spectra of the reduced density matrix along the boundary RG flows. We also point out that the bulk contribution to the single-copy entanglement is half of that to the von Neumann entropy, whereas the boundary contribution is the same.

Dark periods and revivals of entanglement in a two-qubit system

In a recent paper Yu and Eberly [Phys. Rev. Lett. 93, 140404 (2004)] have shown that two initially entangled and afterward not interacting qubits can become completely disentangled in a finite time. We study transient entanglement between two qubits coupled collectively to a multimode vacuum field, assuming that the two-qubit system is initially prepared in an entangled state produced by the two-photon coherences, and find the unusual feature that the irreversible spontaneous decay can lead to a revival of the entanglement that has already been destroyed. The results show that this feature is independent of the coherent dipole-dipole interaction between the atoms but it depends critically on whether or not collective damping is present.

Teleportation via Multi-Qubit Channels

We investigate the problem of teleporting an unknown qubit state to a recipient via a channel of 2L qubits. In this procedure a protocol is employed whereby L Bell state measurements are made and information based on these measurements is sent via a classical channel to the recipient. Upon receiving this information the recipient determines a local gate which is used to recover the original state. We find that the 2(2L)-dimensional Hilbert space of states available for the channel admits a decomposition into four subspaces. Every state within a given subspace is a perfect channel, and each sequence of Bell measurements projects 2L qubits of the system into one of the four subspaces. As a result, only two bits of classical information need be sent to the recipient for them to determine the gate. We note some connections between these four subspaces and ground states of many-body Hamiltonian systems, and discuss the implications of these results towards understanding entanglement in multi-qubit systems.

Palynostratigraphy of Ordovician strata, Canning Basin, Western Australia. Part One: acritarchs and prasinophytes

This paper is the initial part of a comprehensive bipartite monograph of palynomorphs (viz., acritarchs, prasinophyte phycomata, and chitinozoans) that are represented profusely in marine lower Palaeozoic strata of the Canning Basin, Western Australia. The prime aim is to establish a palynologically based zonal scheme for the Ordovician sequence as represented in five cored boreholes drilled through the Lower to Middle Ordovician strata of the central-northeastern Canning Basin. These strata embrace the Oepikodus communis through Phragmodus-Plectodina conodont zonal interval and comprise (in ascending order) the Willara, Goldwyer, and Nita formations, of inferred early Arenig to Llanvirn age. All three formations contain moderately diverse and variably preserved palynomorphs. The palynomorph taxa, detailed systematically in the current Part One of this monograph, comprise 66 species of acritarchs and six of prasinophytes. Of these, two species of prasinophytes and 11 of acritarchs are newly established: Cymatiosphaera meandrica and Pterospermella franciniae; Aremoricanium hyalinum, A. solaris, Baltisphaeridium tenuicomatum, Gorgonisphaeridium crebrum, Lophosphaeridium aequalium, L. aspersum, Micrhystridium infrequens, Pylantios hadrus, Sertulidium amplexum, Striatotheca indistincta, and Tribulidium globosum. Pylantios (typified by P. hadrus), Sertulidium (typified by S. amplexum), and Tribulidium (typified by T globosum); are defined as new acritarch genera. Three new combinations are instituted: Baltisphaeridium pugiatum (PLAYFORD & MARTIN 1984), Polygonium canningianum (COMRAZ & PENIGUEL 1972), and Sacculidium furtivum (PLAYFORD & MARTIN 1984); and Ammonidium macilentum PLAYFORD & MARTIN 1984 and Sacculidium furtivum (PLAYFORD & MARTIN 1984) are emended. An appreciable number of palynomorph species are not formally named owing to lack of sufficient or adequately preserved specimens; others are compared but not positively identified with previously instituted species. The ensuing Part Two of this study will complete the systematic-descriptive documentation, i.e., chitinozoans, and evaluate the Canning Basin palynoflora in terms of its chronological and stratigraphic-correlative significance.

Quantum Information Processing with spin systems: from modeling to possible implementations

The physical implementation of quantum information processing is one of the major challenges of current research. In the last few years, several theoretical proposals and experimental demonstrations on a small number of qubits have been carried out, but a quantum computing architecture that is straightforwardly scalable, universal, and realizable with state-of-the-art technology is still lacking. In particular, a major ultimate objective is the construction of quantum simulators, yielding massively increased computational power in simulating quantum systems. Here we investigate promising routes towards the actual realization of a quantum computer, based on spin systems. The first one employs molecular nanomagnets with a doublet ground state to encode each qubit and exploits the wide chemical tunability of these systems to obtain the proper topology of inter-qubit interactions. Indeed, recent advances in coordination chemistry allow us to arrange these qubits in chains, with tailored interactions mediated by magnetic linkers. These act as switches of the effective qubit-qubit coupling, thus enabling the implementation of one- and two-qubit gates. Molecular qubits can be controlled either by uniform magnetic pulses, either by local electric fields. We introduce here two different schemes for quantum information processing with either global or local control of the inter-qubit interaction and demonstrate the high performance of these platforms by simulating the system time evolution with state-of-the-art parameters. The second architecture we propose is based on a hybrid spin-photon qubit encoding, which exploits the best characteristic of photons, whose mobility is exploited to efficiently establish long-range entanglement, and spin systems, which ensure long coherence times. The setup consists of spin ensembles coherently coupled to single photons within superconducting coplanar waveguide resonators. The tunability of the resonators frequency is exploited as the only manipulation tool to implement a universal set of quantum gates, by bringing the photons into/out of resonance with the spin transition. The time evolution of the system subject to the pulse sequence used to implement complex quantum algorithms has been simulated by numerically integrating the master equation for the system density matrix, thus including the harmful effects of decoherence. Finally a scheme to overcome the leakage of information due to inhomogeneous broadening of the spin ensemble is pointed out. Both the proposed setups are based on state-of-the-art technological achievements. By extensive numerical experiments we show that their performance is remarkably good, even for the implementation of long sequences of gates used to simulate interesting physical models. Therefore, the here examined systems are really promising buildingblocks of future scalable architectures and can be used for proof-of-principle experiments of quantum information processing and quantum simulation.

Stratigrafia fisica ed analisi di facies dei depositi torbiditici della Formazione delle Arenarie del Monte Cervarola tra la Val Secchia e la Val Scoltenna (Aquitaniano-Burdigaliano, Appennino Settentrionale)

The Cervarola Sandstones Formation (CSF), Aquitanian-Burdigalian in age, was deposited in an elongate, NW-stretched foredeep basin formed in front of the growing Northern Apennines orogenic wedge. The stratigraphic succession of the CSF, in the same way of other Apennine foredeep deposits, records the progressive closure of the basin due to the propagation of thrust fronts toward north-east, i.e. toward the outer and shallower foreland ramp. This process produce a complex foredeep characterized by synsedimentary structural highs and depocenters that can strongly influence the lateral and vertical turbidite facies distribution. Of consequence the main aim of this work is to describe and discuss this influence on the basis of a new high-resolution stratigraphic framework performed by measuring ten stratigraphic logs, for a total thickness of about 2000m, between the Secchia and Scoltenna Valleys (30km apart). In particular, the relationship between the turbidite sedimentation and the ongoing tectonic activity during the foredeep evolution has been describe through various stratigraphic cross sections oriented parallel and perpendicular to the main tectonic structures. On the basis of the high resolution physical stratigraphy of the studied succession, we propose a facies tract and an evolutionary model for the Cervarola Sandstones in the studied area. Thanks to these results and the analogies with others foredeep deposits of the northern Apennines, such as the Marnoso-arenacea Formation, the Cervarola basin has been interpreted as a highly confined foredeep controlled by an intense synsedimentary tectonic activity. The most important evidences supporting this hypothesis are: 1) the upward increase, in the studied stratigraphic succession (about 1000m thick), of sandstone/mudstone ratio, grain sizes and Ophiomorpha-type trace fossils testifying the high degree of flow deceleration related to the progressive closure and uplift of the foredeep. 2) the occurrence in the upper part of the stratigraphic succession of coarse-grained massive sandstones overlain by tractive structures such as megaripples and traction carpets passing downcurrent into fine-grained laminated contained-reflected beds. This facies tract is interpreted as related to deceleration and decoupling of bipartite flows with the deposition of the basal dense flows and bypass of the upper turbulent flows. 3) the widespread occurrence of contained reflected beds related to morphological obstacles created by tectonic structures parallel and perpendicular to the basin axis (see for example the Pievepelago line). 4) occurrence of intra-formational slumps, constituted by highly deformed portion of fine-grained succession, indicating a syn-sedimentary tectonic activity of the tectonic structures able to destabilize the margins of the basin. These types of deposits increase towards the upper part of the stratigraphic succession (see points 1 and 2) 5) the impressive lateral facies changes between intrabasinal topographic highs characterized by fine-grained and thin sandstone beds and marlstones and depocenters characterized by thick to very thick coarse-grained massive sandstones. 6) the common occurrence of amalgamation surfaces, flow impact structures and mud-draped scours related to sudden deceleration of the turbidite flows induced by the structurally-controlled confinement and morphological irregularities. In conclusion, the CSF has many analogies with the facies associations occurring in other tectonically-controlled foredeeps such as those of Marnoso-arenacea Formation (northern Italy) and Annot Sandstones (southern France) showing how thrust fronts and transversal structures moving towards the foreland, were able to produce a segmented foredeep that can strongly influence the turbidity current deposition.

Reacting and responding in TESOL Quarterly:a generic analysis of procedure and purpose in intertextual critical exchanges

A key feature of ‘TESOL Quarterly’, a leading journal in the world of TESOL/applied linguistics, is its ‘Forum’ section which invites ‘responses and rebuttals’ from readers to any of its articles. These ‘responses or rebuttals’ form the focus of this research. In the interchanges between readers reacting to earlier research articles in TESOL Quarterly and authors responding to the said reaction I – examine the texts for evidence of genre-driven structure, whether shared between both ‘reaction’ and ‘response’ sections, or peculiar to each section, and attempt to determine the precise nature of the intended communicative purpose in particular and the implications for academic debate in general. The intended contribution of this thesis is to provide an analysis of how authors of research articles and their critics pursue their efforts beyond the research article which precipitated these exchanges in order to be recognized by their discourse community as, in the terminology of Swales (1981:51), ‘Primary Knowers’. Awareness of any principled generic process identified in this thesis may be of significance to practitioners in the applied linguistics community in their quest to establish academic reputation and in their pursuit of professional development. These findings may also be of use in triggering productive community discussion as a result of the questions they raise concerning the present nature of academic debate. Looking beyond the construction and status of the texts themselves, I inquire into the kind of ideational and social organization such exchanges keep in place and examine an alternative view of interaction. This study breaks new ground in two major ways. To the best of my knowledge, it is the first exploration of a bipartite, intertextual structure laying claim to genre status. Secondly, in its recourse to the comments of the writers’ themselves rather than relying exclusively on the evidence of their texts, as is the case with most studies of genre, this thesis offers an expanded opportunity to discuss perhaps the most interesting aspects of genre analysis – the light it throws on social ends and the role of genre in determining the nature of current academic debate as it here emerges.

Decoherence of charge qubit coupled to interacting background charges

The major contribution to decoherence of a double quantum dot or a Josephson-junction charge qubit comes from the electrostatic coupling to fluctuating background charges hybridized with the conduction electrons in the reservoir. However, estimations according to previously developed theories show that finding a sufficient number of effective fluctuators in a realistic experimental layout is quite improbable. We show that this paradox is resolved by allowing for a short-range Coulomb interaction of the fluctuators with the electrons in the reservoir. This dramatically enhances both the number of effective fluctuators and their contribution to decoherence, resulting in the most dangerous decoherence mechanism for charge qubits.

Infer user interests via link structure regularization

Learning user interests from online social networks helps to better understand user behaviors and provides useful guidance to design user-centric applications. Apart from analyzing users' online content, it is also important to consider users' social connections in the social Web. Graph regularization methods have been widely used in various text mining tasks, which can leverage the graph structure information extracted from data. Previously, graph regularization methods operate under the cluster assumption that nearby nodes are more similar and nodes on the same structure (typically referred to as a cluster or a manifold) are likely to be similar. We argue that learning user interests from complex, sparse, and dynamic social networks should be based on the link structure assumption under which node similarities are evaluated based on the local link structures instead of explicit links between two nodes. We propose a regularization framework based on the relation bipartite graph, which can be constructed from any type of relations. Using Twitter as our case study, we evaluate our proposed framework from social networks built from retweet relations. Both quantitative and qualitative experiments show that our proposed method outperforms a few competitive baselines in learning user interests over a set of predefined topics. It also gives superior results compared to the baselines on retweet prediction and topical authority identification. © 2014 ACM.

What is Q-extension?

In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.

Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.

On axiomatizations of the Shapley value for assignment games

We consider the problem of axiomatizing the Shapley value on the class of assignment games. We first show that several axiomatizations of the Shapley value on the class of all TU-games do not characterize this solution on the class of assignment games by providing alternative solutions that satisfy these axioms. However, when considering an assignment game as a communication graph game where the game is simply the assignment game and the graph is a corresponding bipartite graph buyers are connected with sellers only, we show that Myerson's component efficiency and fairness axioms do characterize the Shapley value on the class of assignment games. Moreover, these two axioms have a natural interpretation for assignment games. Component efficiency yields submarket efficiency stating that the sum of the payoffs of all players in a submarket equals the worth of that submarket, where a submarket is a set of buyers and sellers such that all buyers in this set have zero valuation for the goods offered by the sellers outside the set, and all buyers outside the set have zero valuations for the goods offered by sellers inside the set. Fairness of the graph game solution boils down to valuation fairness stating that only changing the valuation of one particular buyer for the good offered by a particular seller changes the payoffs of this buyer and seller by the same amount.

Practical engineering of hard spin-glass instances

Recent technological developments in the field of experimental quantum annealing have made prototypical annealing optimizers with hundreds of qubits commercially available. The experimental demonstration of a quantum speedup for optimization problems has since then become a coveted, albeit elusive goal. Recent studies have shown that the so far inconclusive results, regarding a quantum enhancement, may have been partly due to the benchmark problems used being unsuitable. In particular, these problems had inherently too simple a structure, allowing for both traditional resources and quantum annealers to solve them with no special efforts. The need therefore has arisen for the generation of harder benchmarks which would hopefully possess the discriminative power to separate classical scaling of performance with size from quantum. We introduce here a practical technique for the engineering of extremely hard spin-glass Ising-type problem instances that does not require "cherry picking" from large ensembles of randomly generated instances. We accomplish this by treating the generation of hard optimization problems itself as an optimization problem, for which we offer a heuristic algorithm that solves it. We demonstrate the genuine thermal hardness of our generated instances by examining them thermodynamically and analyzing their energy landscapes, as well as by testing the performance of various state-of-the-art algorithms on them. We argue that a proper characterization of the generated instances offers a practical, efficient way to properly benchmark experimental quantum annealers, as well as any other optimization algorithm.

Iterative Phase Optimization of Elementary Quantum Error Correcting Codes

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits, as errors can be fully characterized. For multiqubit operations, though, this is no longer the case, as in the most general case, analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments, additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum-information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g., a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript, we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum-information processing.

Utilização de pulsos de radiofrequência fortemente modulados no processamento de informação quântica via ressonância magnética nuclear

Nesta dissertação apresentamos um trabalho de desenvolvimento e utilização de pulsos de radiofreqüência modulados simultaneamente em freqüência, amplitude e fase (pulsos fortemente modulados, SMP, do inglês Strongly Modulated Pulses) para criar estados iniciais e executar operações unitárias que servem como blocos básicos para processamento da informação quântica utilizando Ressonância Magnética Nuclear (RMN). As implementações experimentais foram realizas em um sistema de 3 q-bits constituído por spins nucleares de Césio 133 (spin nuclear 7/2) em uma amostra de cristal líquido em fase nemática. Os pulsos SMP´s foram construídos teoricamente utilizando um programa especialmente desenvolvido para esse fim, sendo o mesmo baseado no processo de otimização numérica Simplex Nelder-Mead. Através deste programa, os pulsos SMP foram otimizados de modo a executarem as operações lógicas desejadas com durações consideravelmente menores que aquelas realizadas usando o procedimento usual de RMN, ou seja, seqüências de pulsos e evoluções livres. Isso tem a vantagem de reduzir os efeitos de descoerência decorrentes da relaxação do sistema. Os conceitos teóricos envolvidos na criação dos SMPs são apresentados e as principais dificuldades (experimentais e teóricas) que podem surgir devido ao uso desses procedimentos são discutidas. Como exemplos de aplicação, foram produzidos os estados pseudo-puros usados como estados iniciais de operações lógicas em RMN, bem como operações lógicas que foram posteriormente aplicadas aos mesmos. Utilizando os SMP\'s também foi possível realizar experimentalmente os algoritmos quânticos de Grover e Deutsch-Jozsa para 3 q-bits. A fidelidade das implementações experimentais foi determinadas utilizando as matrizes densidade experimentais obtidas utilizando um método de tomografia da matriz densidade previamente desenvolvido.