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.

Integrated System Technologies for Modular Trapped Ion Quantum Information Processing

Although trapped ion technology is well-suited for quantum information science, scalability of the system remains one of the main challenges. One of the challenges associated with scaling the ion trap quantum computer is the ability to individually manipulate the increasing number of qubits. Using micro-mirrors fabricated with micro-electromechanical systems (MEMS) technology, laser beams are focused on individual ions in a linear chain and steer the focal point in two dimensions. Multiple single qubit gates are demonstrated on trapped 171Yb+ qubits and the gate performance is characterized using quantum state tomography. The system features negligible crosstalk to neighboring ions (< 3e-4), and switching speeds comparable to typical single qubit gate times (< 2 us). In a separate experiment, photons scattered from the 171Yb+ ion are coupled into an optical fiber with 63% efficiency using a high numerical aperture lens (0.6 NA). The coupled photons are directed to superconducting nanowire single photon detectors (SNSPD), which provide a higher detector efficiency (69%) compared to traditional photomultiplier tubes (35%). The total system photon collection efficiency is increased from 2.2% to 3.4%, which allows for fast state detection of the qubit. For a detection beam intensity of 11 mW/cm2, the average detection time is 23.7 us with 99.885(7)% detection fidelity. The technologies demonstrated in this thesis can be integrated to form a single quantum register with all of the necessary resources to perform local gates as well as high fidelity readout and provide a photon link to other systems.

Micro-Fabricated Surface Trap and Cavity Integration for Trapped Ion Quantum Computing

Atomic ions trapped in micro-fabricated surface traps can be utilized as a physical platform with which to build a quantum computer. They possess many of the desirable qualities of such a device, including high fidelity state preparation and readout, universal logic gates, long coherence times, and can be readily entangled with each other through photonic interconnects. The use of optical cavities integrated with trapped ion qubits as a photonic interface presents the possibility for order of magnitude improvements in performance in several key areas of their use in quantum computation. The first part of this thesis describes the design and fabrication of a novel surface trap for integration with an optical cavity. The trap is custom made on a highly reflective mirror surface and includes the capability of moving the ion trap location along all three trap axes with nanometer scale precision. The second part of this thesis demonstrates the suitability of small micro-cavities formed from laser ablated fused silica substrates with radii of curvature in the 300-500 micron range for use with the mirror trap as part of an integrated ion trap cavity system. Quantum computing applications for such a system include dramatic improvements in the photonic entanglement rate up to 10 kHz, the qubit measurement time down to 1 microsecond, and the measurement error rates down to the 10e-5 range. The final part of this thesis details a performance simulator for exploring the physical resource requirements and performance demands to scale such a quantum computer to sizes capable of performing quantum algorithms beyond the limits of classical computation.

Sesamoids of the metatarsophalangeal joint of the big toe: a sistematic review

Abstract: The first metatarsal sesamoid bones are not always taken into consideration when making a diagnosis, in pathologies that affect the region of the first metatarsal head. This is due to the insufficient knowledge of all the pathologies that can affect the sesamoids and the relative little incidence that they have. With the increment of sports activities, in particular the running, increasingly affects of the symptoms concerning this region are observed. Methods: A literature search was performed in 5 databases (Medline, PubMed, Scopus, Cochrane Library and BUCEA). The terms included in the search were: sesamoids, anatomy, biomechanics, sesamoids review and sesamoids pathology. In the initial search articles with no more than 10 years, only humans and revision texts are considered. Results: 24 articles were selected and include different pathologies with diagnosis using imaging tests and treatments, both conservative and surgical; as well as aspects from the biomechanics of the metatarsal-sesamoid joint. Conclusion: Sesamoids due of his anatomy, topography and function can be involved in a lot of pathologies; with similar signs and symptoms that can confuse the podiatry when he has to make a correct diagnosis or treatment.

Optical and Spin Properties of Defect-Bound Excitons in Semiconductors

Thesis (Ph.D.)--University of Washington, 2016-08

Memory effects and geometrical considerations in open quantum systems

This thesis discusses memory effects in open quantum systems with an emphasis on the Breuer, Laine, Piilo (BLP) measure of non-Markovianity. It is shown how the calculation of the measure can be simplifed and how quantum information protocols can bene t from memory e ects. The superdense coding protocol is used as an example of this. The quantum Zeno effect will also be studied from the point of view of memory e ects. Finally the geometric ideas used in simplifying the calculation of the BLP measure are applied in studying the amount of resources needed for detecting bipartite quantum correlations. It is shown that to decide without prior information if an unknown quantum state is entangled or not, an informationally complete measurement is required. The first part of the thesis contains an introduction to the theoretical ideas such as quantum states, closed and open quantum systems and necessary mathematical tools. The theory is then applied in the second part of the thesis as the results obtained in the original publications I-VI are presented and discussed.

Genetic manipulation of Anopheles stephensi immunity to increase plasmodium falciparum salivary gland sporozoite infection levels

Human malaria is responsible for over 700,000 deaths a year. To stay abreast of the threat posed by the parasite, a constant stream of new drugs and vector control methods are required. This study focuses on a vaccine that has the potential to protect against parasite infection, but has been hindered by developmental challenges. In malaria prevention, live, attenuated, aseptic, Plasmodium falciparum sporozoites (PfSPZ) can be administered as a highly protective vaccine. PfSPZ are produced using adult female Anopheles stephensi mosquitoes as bioreactors. Production volume and cost of a PfSPZ vaccine for malaria are expected to be directly correlated with Plasmodium falciparum infection intensity in the salivary glands. The sporogonic development of Plasmodium falciparum in A. stephensi to fully infected salivary gland stage sporozoites is dictated by the activities of several known components of the mosquito’s innate immune system. Here I report on the use of genetic technologies that have been rarely, if ever, used in Anopheles stephensi Sda500 to increase the yield of sporozoites per mosquito and enhance vaccine production. By combining the Gal4/UAS bipartite system with in vivo expression of shRNA gene silencing, activity of the IMD signaling pathway downstream effector LRIM1, an antagonist to Plasmodium development, was reduced in the midgut, fat body, and salivary glands of A. stephensi. In infection studies using P. berghei and P. falciparum these transgenic mosquitoes consistently produced significantly more salivary gland stage sporozoites than wildtype controls, with increases in P. falciparum ranging from 2.5 to 10 fold. Using Plasmodium infection assays and qRT-PCR, two novel findings were identified. First, it was shown that 14 days post Plasmodium infection, transcript abundance of the IMD immune effector genes LRIM1, TEP1 and APL1c are elevated, in the salivary glands of A. stephensi, suggesting the salivary glands may play a role in post midgut defense against the parasite. Second, a non-pathogenic IMD signaling pathway response was observed which could suggest an alternative pathway for IMD activation. The information gained from these studies has significantly increased our knowledge of Plasmodium defense in A. stephensi and moreover could significantly improve vaccine production.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Generating a state t-design by diagonal quantum circuits

We investigate protocols for generating a state t-design by using a fixed separable initial state and a diagonal-unitary t-design in the computational basis, which is a t-design of an ensemble of diagonal unitary matrices with random phases as their eigenvalues. We first show that a diagonal-unitary t-design generates a O (1/2(N))-approximate state t-design, where N is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary t-design. We also show that it is necessary and sufficient to use O (log(2)(t)) -qubit gates with random phases to generate a diagonal-unitary t-design by diagonal quantum circuits, and that each multi-qubit diagonal gate can be replaced by a sequence of multi-qubit controlled-phase-type gates with discrete-valued random phases. Finally, we analyze the number of gates for implementing a diagonal-unitary t-design by non-diagonal two- and one-qubit gates. Our results provide a concrete application of diagonal quantum circuits in quantum informational tasks.

'Abnormal vertical growth' : A disorder threatening the viability of the Australian macadamia industry

'Abnormal vertical growth' (AVG) was recognised in Australia as a dysfunction of macadamia (Macadamia spp.) in the mid-1990s. Affected trees displayed unusually erect branching, and poor flowering and yield. Since 2002, the commercial significance of AVG, its cause, and strategies to alleviate its affects, has been studied. The cause is still unknown, and AVG remains a serious threat to orchard viability. AVG affects both commercial and urban macadamia. It occurs predominantly in the warmer-drier production regions of Queensland and New South Wales. An estimated 100,000 orchard trees are affected, equating to an annual loss of $ 10.5 M. In orchards, AVG occurs as aggregations of affected trees, affected tree number can increase by 4.5% per year, and yield reduction can exceed 30%. The more upright cultivars 'HAES 344' and '741' are highly susceptible, while the more spreading cultivars 'A4', 'A16' and 'A268' show tolerance. Incidence is higher (p<0.05) in soils of high permeability and good drainage. No soil chemical anomaly has been found. Fine root dry weight of AVG trees (0-15 cm depth) was found lower (p<0.05) than non-AVG. Next generation sequencing has led to the discovery of a new Bacillus sp. and a bipartite Geminivirus, which may have a role in the disease. Trunk cinctures will increase (p<0.05) yield of moderately affected trees. Further research is needed to clarify whether a pathogen is the cause, the role of soil moisture in AVG, and develop a varietal solution.