Specification format and a verification method of fault-tolerant quantum circuits

© 2018 American Physical Society. Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimization and execution of the expressed computations. However, the specification format makes it difficult to verify that optimized or executed computations still conform to the initial gate list specifications: showing the computational equivalence between two quantum circuits expressed by different lists of quantum gates is exponentially complex in the worst case. In order to solve this issue, this work presents a derivation of the specification format tailored specifically for fault-tolerant quantum circuits. The circuits are considered a form consisting entirely of single qubit initializations, cnot gates, and single qubit measurements (ICM form). This format allows, under certain assumptions, to efficiently verify optimized (or implemented) computations. Two verification methods based on checking stabilizer circuit structures are presented

A local and scalable lattice renormalization method for ballistic quantum computation

© 2018, The Author(s). A recent proposal has shown that it is possible to perform linear-optics quantum computation using a ballistic generation of the lattice. Yet, due to the probabilistic generation of its cluster state, it is not possible to use the fault-tolerant Raussendorf lattice, which requires a lower failure rate during the entanglement-generation process. Previous work in this area showed proof-of-principle linear-optics quantum computation, while this paper presents an approach to it which is more practical, satisfying several key constraints. We develop a classical measurement scheme that purifies a large faulty lattice to a smaller lattice with entanglement faults below threshold. A single application of this method can reduce the entanglement error rate to 7% for an input failure rate of 25%. Thus, we can show that it is possible to achieve fault tolerance for ballistic methods

Fault-tolerant, high-level quantum circuits: Form, compilation and description

© 2017 IOP Publishing Ltd. Fault-tolerant quantum error correction is a necessity for any quantum architecture destined to tackle interesting, large-scale problems. Its theoretical formalism has been well founded for nearly two decades. However, we still do not have an appropriate compiler to produce a fault-tolerant, error-corrected description from a higher-level quantum circuit for state-of the-art hardware models. There are many technical hurdles, including dynamic circuit constructions that occur when constructing fault-tolerant circuits with commonly used error correcting codes. We introduce a package that converts high-level quantum circuits consisting of commonly used gates into a form employing all decompositions and ancillary protocols needed for fault-tolerant error correction. We call this form the (I)initialisation, (C)NOT, (M)measurement form (ICM) and consists of an initialisation layer of qubits into one of four distinct states, a massive, deterministic array of CNOT operations and a series of time-ordered X- or Z-basis measurements. The form allows a more flexible approach towards circuit optimisation. At the same time, the package outputs a standard circuit or a canonical geometric description which is a necessity for operating current state-of-the-art hardware architectures using topological quantum codes

Lattice surgery on the Raussendorf lattice

© 2018 IOP Publishing Ltd. Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that eases physical hardware implementations. Lattice surgery approaches to algorithmic compilation and optimization have been demonstrated to be more resource efficient for resource-intensive components of a fault-tolerant algorithm, and consequently may be preferable over braid-based logic. Lattice surgery can be extended to the Raussendorf lattice, providing a measurement-based approach to the surface code. In this paper we describe how lattice surgery can be performed on the Raussendorf lattice and therefore give a viable alternative to computation using braiding in measurement-based implementations of topological codes

Socio-Demographic Profile of Scavenging Households in Umapad Dumpsite, Mandaue City Cebu, Philippines

Scavengers being informal settlers are often not provided by the government with basic services. Furthermore, they are often exposed to occupational safety and health hazard and yet they to continue to rely on wastepicking as their major source of income. Upon the implementation of the Ecological Solid Waste Management Act (RA 9003) by the city government of Mandaue, this significantly lowered the income of the scavengers by 62.34%. This indicates a conflict of interest between the scavengers and the implementing body. Hence, a comprehensive environmental and socio-economic policy should be planned to identify the needs of the scavengers and address the interest of both parties

Platforms and software systems for an autonomic internet

The current Internet does not enable easy introduction and deployment of new network technologies and services. This paper aims to progress the Future Internet (FI) by introduction of a service composition and execution environment that re-use existing components of access and core networks. This paper presents essential service-centric platforms and software systems that have been developed with the aim to create a flexible environment for an Autonomic Internet.Peer ReviewedPostprint (published version

Removing leakage-induced correlated errors in superconducting quantum error correction

Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During computation, unused high energy levels of the qubits can become excited, creating leakage states that are long-lived and mobile. Particularly for superconducting transmon qubits, this leakage opens a path to errors that are correlated in space and time. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We test its performance with the bit-flip stabilizer code, a simplified version of the surface code for quantum error correction. We investigate the accumulation and dynamics of leakage during error correction. Using this protocol, we find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number. This demonstration provides a key step on the path towards scalable quantum computing

Potential therapeutic applications of microbial surface-activecompounds

Numerous investigations of microbial surface-active compounds or biosurfactants over the past two decades have led to the discovery of many interesting physicochemical and biological properties including antimicrobial, anti-biofilm and therapeutic among many other pharmaceutical and medical applications. Microbial control and inhibition strategies involving the use of antibiotics are becoming continually challenged due to the emergence of resistant strains mostly embedded within biofilm formations that are difficult to eradicate. Different aspects of antimicrobial and anti-biofilm control are becoming issues of increasing importance in clinical, hygiene, therapeutic and other applications. Biosurfactants research has resulted in increasing interest into their ability to inhibit microbial activity and disperse microbial biofilms in addition to being mostly nontoxic and stable at extremes conditions. Some biosurfactants are now in use in clinical, food and environmental fields, whilst others remain under investigation and development. The dispersal properties of biosurfactants have been shown to rival that of conventional inhibitory agents against bacterial, fungal and yeast biofilms as well as viral membrane structures. This presents them as potential candidates for future uses in new generations of antimicrobial agents or as adjuvants to other antibiotics and use as preservatives for microbial suppression and eradication strategies