14 research outputs found
Optimal Layout Synthesis for Quantum Computing
Recent years have witnessed the fast development of quantum computing.
Researchers around the world are eager to run larger and larger quantum
algorithms that promise speedups impossible to any classical algorithm.
However, the available quantum computers are still volatile and error-prone.
Thus, layout synthesis, which transforms quantum programs to meet these
hardware limitations, is a crucial step in the realization of quantum
computing. In this paper, we present two synthesizers, one optimal and one
approximate but nearly optimal. Although a few optimal approaches to this
problem have been published, our optimal synthesizer explores a larger solution
space, thus is optimal in a stronger sense. In addition, it reduces time and
space complexity exponentially compared to some leading optimal approaches. The
key to this success is a more efficient spacetime-based variable encoding of
the layout synthesis problem as a mathematical programming problem. By slightly
changing our formulation, we arrive at an approximate synthesizer that is even
more efficient and outperforms some leading heuristic approaches, in terms of
additional gate cost, by up to 100%, and also fidelity by up to 10x on a
comprehensive set of benchmark programs and architectures. For a specific
family of quantum programs named QAOA, which is deemed to be a promising
application for near-term quantum computers, we further adjust the approximate
synthesizer by taking commutation into consideration, achieving up to 75%
reduction in depth and up to 65% reduction in additional cost compared to the
tool used in a leading QAOA study.Comment: to appear in ICCAD'2
Optimal Qubit Mapping with Simultaneous Gate Absorption
Before quantum error correction (QEC) is achieved, quantum computers focus on
noisy intermediate-scale quantum (NISQ) applications. Compared to the
well-known quantum algorithms requiring QEC, like Shor's or Grover's algorithm,
NISQ applications have different structures and properties to exploit in
compilation. A key step in compilation is mapping the qubits in the program to
physical qubits on a given quantum computer, which has been shown to be an
NP-hard problem. In this paper, we present OLSQ-GA, an optimal qubit mapper
with a key feature of simultaneous SWAP gate absorption during qubit mapping,
which we show to be a very effective optimization technique for NISQ
applications. For the class of quantum approximate optimization algorithm
(QAOA), an important NISQ application, OLSQ-GA reduces depth by up to 50.0% and
SWAP count by 100% compared to other state-of-the-art methods, which translates
to 55.9% fidelity improvement. The solution optimality of OLSQ-GA is achieved
by the exact SMT formulation. For better scalability, we augment our approach
with additional constraints in the form of initial mapping or alternating
matching, which speeds up OLSQ-GA by up to 272X with no or little loss of
optimality.Comment: 8 pages, 8 figures, to appear in ICCAD'2
Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a
promising platform for quantum information processing. In DPQA, atomic qubits
are selectively loaded into arrays of optical traps that can be reconfigured
during the computation itself. Leveraging qubit transport and parallel,
entangling quantum operations, different pairs of qubits, even those initially
far away, can be entangled at different stages of the quantum program
execution. Such reconfigurability and non-local connectivity present new
challenges for compilation, especially in the layout synthesis step which
places and routes the qubits and schedules the gates. In this paper, we
consider a DPQA architecture that contains multiple arrays and supports 2D
array movements, representing cutting-edge experimental platforms. Within this
architecture, we discretize the state space and formulate layout synthesis as a
satisfactory modulo theories problem, which can be solved by existing solvers
optimally in terms of circuit depth. For a set of benchmark circuits generated
by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces
the number of two-qubit entangling gates on small problem instances by 1.7x
compared to optimal compilation results on a fixed planar architecture. To
further improve scalability and practicality of the method, we introduce a
greedy heuristic inspired by the iterative peeling approach in classical
integrated circuit routing. Using a hybrid approach that combined the greedy
and optimal methods, we demonstrate that our DPQA-based compiled circuits
feature reduced scaling overhead compared to a grid fixed architecture,
resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These
methods enable programmable, complex quantum circuits with neutral atom quantum
computers, as well as informing both future compilers and future hardware
choices.Comment: An extended abstract of this work was presented at the 41st
International Conference on Computer-Aided Design (ICCAD '22
Global, regional, and national burden of disorders affecting the nervous system, 1990–2021: a systematic analysis for the Global Burden of Disease Study 2021
BackgroundDisorders affecting the nervous system are diverse and include neurodevelopmental disorders, late-life neurodegeneration, and newly emergent conditions, such as cognitive impairment following COVID-19. Previous publications from the Global Burden of Disease, Injuries, and Risk Factor Study estimated the burden of 15 neurological conditions in 2015 and 2016, but these analyses did not include neurodevelopmental disorders, as defined by the International Classification of Diseases (ICD)-11, or a subset of cases of congenital, neonatal, and infectious conditions that cause neurological damage. Here, we estimate nervous system health loss caused by 37 unique conditions and their associated risk factors globally, regionally, and nationally from 1990 to 2021.MethodsWe estimated mortality, prevalence, years lived with disability (YLDs), years of life lost (YLLs), and disability-adjusted life-years (DALYs), with corresponding 95% uncertainty intervals (UIs), by age and sex in 204 countries and territories, from 1990 to 2021. We included morbidity and deaths due to neurological conditions, for which health loss is directly due to damage to the CNS or peripheral nervous system. We also isolated neurological health loss from conditions for which nervous system morbidity is a consequence, but not the primary feature, including a subset of congenital conditions (ie, chromosomal anomalies and congenital birth defects), neonatal conditions (ie, jaundice, preterm birth, and sepsis), infectious diseases (ie, COVID-19, cystic echinococcosis, malaria, syphilis, and Zika virus disease), and diabetic neuropathy. By conducting a sequela-level analysis of the health outcomes for these conditions, only cases where nervous system damage occurred were included, and YLDs were recalculated to isolate the non-fatal burden directly attributable to nervous system health loss. A comorbidity correction was used to calculate total prevalence of all conditions that affect the nervous system combined.FindingsGlobally, the 37 conditions affecting the nervous system were collectively ranked as the leading group cause of DALYs in 2021 (443 million, 95% UI 378–521), affecting 3·40 billion (3·20–3·62) individuals (43·1%, 40·5–45·9 of the global population); global DALY counts attributed to these conditions increased by 18·2% (8·7–26·7) between 1990 and 2021. Age-standardised rates of deaths per 100 000 people attributed to these conditions decreased from 1990 to 2021 by 33·6% (27·6–38·8), and age-standardised rates of DALYs attributed to these conditions decreased by 27·0% (21·5–32·4). Age-standardised prevalence was almost stable, with a change of 1·5% (0·7–2·4). The ten conditions with the highest age-standardised DALYs in 2021 were stroke, neonatal encephalopathy, migraine, Alzheimer's disease and other dementias, diabetic neuropathy, meningitis, epilepsy, neurological complications due to preterm birth, autism spectrum disorder, and nervous system cancer.InterpretationAs the leading cause of overall disease burden in the world, with increasing global DALY counts, effective prevention, treatment, and rehabilitation strategies for disorders affecting the nervous system are needed
Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices
Multidepot Heterogeneous Vehicle Routing Problem for a Variety of Hazardous Materials with Risk Analysis
This study investigates a multidepot heterogeneous vehicle routing problem for a variety of hazardous materials with risk analysis, which is a practical problem in the actual industrial field. The objective of the problem is to design a series of routes that minimize the total cost composed of transportation cost, risk cost, and overtime work cost. Comprehensive consideration of factors such as transportation costs, multiple depots, heterogeneous vehicles, risks, and multiple accident scenarios is involved in our study. The problem is defined as a mixed integer programming model. A bidirectional tuning heuristic algorithm and particle swarm optimization algorithm are developed to solve the problem of different scales of instances. Computational results are competitive such that our algorithm can obtain effective results in small-scale instances and show great efficiency in large-scale instances with 70 customers, 30 vehicles, and 3 types of hazardous materials
DNA methylation profiling of the X chromosome reveals an aberrant demethylation on CXCR3 promoter in primary biliary cirrhosis
Background: Although the etiology of primary biliary cirrhosis (PBC) remains enigmatic, there are several pieces of data supporting the thesis that a strong genetic predisposition and environmental factors interact to produce a selective loss of tolerance. The striking female predominance of PBC has suggested that this sex predisposition may be secondary to epigenetic alterations on the X chromosome. In the present study, we rigorously defined the X chromosome methylation profile of CD4, CD8, and CD14 cells from 30 PBC patients and 30 controls. Genomic DNA from sorted CD4, CD8, and CD14 subpopulations was isolated, sonicated, and immunoprecipitated for analysis of methylation. All products were hybridized to a custom-tiled four-plex array containing 27,728 CpG islands annotated by UCSC and 22,532 well-characterized RefSeq promoter regions. Furthermore, bisulfite sequencing was then used for validation on a subsequent group of independent samples from PBC patients and controls. Thence, expression levels of selected X-linked genes were evaluated by quantitative real-time PCR with cDNA samples from all subjects. Results: We report herein that a total of 20, 15, and 19 distinct gene promoters reflected a significant difference in DNA methylation in CD4+ T, CD8+ T, and CD14+ cells in patients with PBC. Interestingly, there was hypermethylation of FUNDC2 in CD8+ T cells and a striking demethylation of CXCR3 in CD4+ T cells, which inversely correlated with CXCR3 expression levels in CD4+ T cells from early-stage PBC patients. Conclusions: Our data provides a set of genes with epigenetic alteration likely to be indicators of autoimmunity and emphasizes the role of CXCR3 in the natural history of PBC