Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum circuit synthesis”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reoptimization of Quantum Circuits via Hierarchical Synthesis

The current phase of quantum computing is in the Noisy Intermediate-Scale Quantum (NISQ) era. On NISQ devices, two-qubit gates such as CNOTs are much noisier than single-qubit gates, so it is essential to minimize their count. Quantum circuit synthesis is a process of decomposing an arbitrary unitary into a sequence of quantum gates, and can be used as an optimization tool to produce shorter circuits to improve overall circuit fidelity. However, the time-to-solution of synthesis grows exponentially with the number of qubits. As a result, synthesis is intractable for circuits on a large qubit scale. In this paper, we propose a hierarchical, block-by-block opti-mization framework, QGo, for quantum circuit optimization. Our approach allows an exponential cost optimization to scale to large circuits. QGo uses a combination of partitioning and synthesis: 1) partition the circuit into a sequence of independent circuit blocks; 2) re-generate and optimize each block using quantum synthesis; and 3) re-compose the final circuit by stitching all the blocks together. We perform our analysis and show the fidelity improvements in three different regimes: small-size circuits on real devices, medium-size circuits on noisy simulations, and large-size circuits on analytical models. Our technique can be applied after existing optimizations to achieve higher circuit fidelity. Further, using a set of NISQ benchmarks, we show that QGo can reduce the number of CNOT gates by 29.9% on average and up to 50% when compared with industrial compiler optimizations such as t|ket). When executed on the IBM Athens system, shorter depth leads to higher circuit fidelity. We also demonstrate the scalability of our QGo technique to optimize circuits of 60+ qubits, Our technique is the first demonstration of successfully employing and scaling synthesis in the compilation tool chain for large circuits. Overall, our approach is robust for direct incorporation in production compiler toolchains to further improve the circuit fidelity.

97 MATHEMATICS AND COMPUTING↗

Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “𝔤-sim”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that 𝔤-sim enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of 𝔤-sim and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

97 MATHEMATICS AND COMPUTING↗

Quantum Circuit Partitioning for Scalable Noise-Aware Quantum Circuit Re-Synthesis

Re-synthesis techniques are utilized to optimize the quantum circuit. To enable scalable re-synthesis a divide-and-conquer approach is adopted that partitions the circuit into smaller blocks, which are optimized independently. Several algorithms have been proposed to minimize the block number while maximizing the gate count of each block. However, they vary in their performance and may not yield the highest output fidelity. We propose a reinforcement learning-based quantum circuit partitioning framework that incorporates the physical properties of the quantum hardware to maximize the output fidelity post-quantum circuit optimization. To accelerate the training, we also propose a noise injection method that enables on-the-fly optimization in the reinforcement learning environment, independent of the adopted optimization/re-synthesis method at the block level. We evaluate our approach compared to different partitioning techniques using various quantum benchmarks executed on IBM Q Hanoi quantum computer.

Charrwi, Mohammad Walid↗

Optimal ancilla-free Pauli+V circuits for axial rotations

We address the problem of optimal representation of single-qubit rotations in a certain unitary basis consisting of the so-called V gates and Pauli matrices. The V matrices were proposed by Lubotsky, Philips, and Sarnak [Commun. Pure Appl. Math. 40, 401–420 (1987)] as a purely geometric construct in 1987 and recently found applications in quantum computation. They allow for exceptionally simple quantum circuit synthesis algorithms based on quaternionic factorization. We adapt the deterministic-search technique initially proposed by Ross and Selinger to synthesize approximating Pauli+V circuits of optimal depth for single-qubit axial rotations. Our synthesis procedure based on simple SL{sub 2}(ℤ) geometry is almost elementary.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constant-depth circuits for dynamic simulations of materials on quantum computers

Abstract Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible simulations to short-time dynamics. Here, we present a method for generating circuits that are constant in depth with increasing simulation time for a specific subset of one-dimensional (1D) materials Hamiltonians, thereby enabling simulations out to arbitrarily long times. Furthermore, by removing the effective limit on the number of feasibly simulatable time-steps, the constant-depth circuits enable Trotter error to be made negligibly small by allowing simulations to be broken into arbitrarily many time-steps. For an N -spin system, the constant-depth circuit contains only $\mathcal {O}(N^{2})$ O ( N 2 ) CNOT gates. Such compact circuits enable us to successfully execute long-time dynamic simulation of ubiquitous models, such as the transverse field Ising and XY models, on current quantum hardware for systems of up to 5 qubits without the need for complex error mitigation techniques. Aside from enabling long-time dynamic simulations with minimal Trotter error for a specific subset of 1D Hamiltonians, our constant-depth circuits can advance materials simulations on quantum computers more broadly in a number of indirect ways.

Materials simulation↗

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in terms of chip size and error rates. Shallow quantum circuits with uncomplicated topologies are essential for successful applications in the NISQ era. In this work, based on matrix analysis, we derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The depth of the compressed circuits is independent of simulation time and grows linearly with the number of spins. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond O(10 3 ) spins. The resulting quantum circuits have a simple nearest-neighbor topology, which makes them ideally suited for NISQ devices.

Hamiltonian simulation↗

A Novel Approach to Quantum Circuit Partitioning

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

Clark, Joseph↗

Quantum Computing Circuits and Devices

The development of quantum computing technologies builds on the unique features of quantum physics while borrowing familiar principles from the design of conventional devices. Here, we introduce the fundamental concepts required for designing and operating quantum computing devices by reviewing state of the art efforts to fabricate and demonstrate quantum gates and qubits. We summarize the near-term challenges for devices based on semiconducting, superconducting, and trapped ion technologies with an emphasis on design tools as well as methods of verification and validation. We then discuss the generation and synthesis of quantum circuits for higher-order logic that can be carried out using quantum computing devices.

97 MATHEMATICS AND COMPUTING↗

Numerical Circuit Synthesis and Compilation for Multi-State Preparation

Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called 'state preparation'; and circuits to implement a given unitary operation, for example by 'unitary synthesis'. In this paper we solve a more general problem: the transformation of a set of m states to another set of m states, which we call 'multi-state preparation'. State preparation and unitary synthesis are special cases; for state preparation, m=1, while for unitary synthesis, m is the dimension of the full Hilbert space. We generate and optimize circuits for multi-state preparation numerically. In cases where a top-down approach based on matrix decompositions is also possible, our method finds circuits with substantially (up to 40 %) fewer two-qubit gates. We discuss possible applications, including efficient preparation of macroscopic superposition ('cat') states and synthesis of quantum channels.

Szasz, Aaron↗

Quantum Fast Approximate Synthesis Tool (QFAST) v1.0.0

We present QFAST, a quantum synthesis tool designed to produce short circuits and to scale well in practice. Our contributions are: 1) a novel representation of circuits able to encode placement and topology; 2) a hierarchical approach with an iterative refinement formulation that combines "coarse-grained" fast optimization during circuit structure search with a good, but slower, optimization stage only in the final circuit instantiation stage. When compared against state-of-the-art techniques, although not optimal, QFAST can generate much shorter circuits for "time dependent evolution" algorithms used by domain scientists. We also show the composability and tunability of our formulation in terms of circuit depth and running time. For example, we show how to generate shorter circuits by plugging in the best available third party synthesis algorithm at a given hierarchy level. Composability enables portability across chip architectures, which is missing from the available approaches.

Younis, Ed↗

Optimal design of two-qubit quantum circuits

In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to nderstand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.

quantum circuit unitary operation↗

Low-loss superconducting titanium nitride grown using plasma-assisted molecular beam epitaxy

Titanium nitride (TiN) is a known superconducting material that is attractive for use as passive components in superconducting circuits for both conventional and quantum information devices. In contrast to conventional synthesis techniques, here, plasma-assisted molecular beam epitaxy is reported to produce high-quality TiN on bare silicon wafers. Using a rf-plasma source to crack the nitrogen molecules and a conventional high-temperature effusion cell for titanium, TiN growth is completed under nitrogen-rich conditions. The growth and nucleation is monitored in situ, while the structure and composition are characterized using x-ray diffraction, atomic force microscopy, x-ray photoelectron spectroscopy, secondary ion mass spectroscopy, and scanning transmission electron microscopy. The stoichiometric TiN (111) films sit on an amorphous nitride layer with low impurity concentrations. The films superconduct with Tc=5.4 K, and coplanar waveguide resonators are fabricated with a small center width of 6 μm that demonstrate single-photon quality factors approaching 1M and high-power quality factors over 5M without observing saturation.

Richardson, C. J. K. (ORCID:0000000188175347)↗

Nanoscale integration is the next frontier for nanotechnology

Nanoscale integration of materials and structures is the next critical step to exploit the promise of nanomaterials. Many novel and fascinating properties have been revealed for nanostructured materials. But if nanotechnology is to live up to its promise we must incorporate these nanoscale building blocks into functional systems that connect to the micro- and macroscale world. To do this we will inevitably need to understand and exploit the resulting combined unique properties of these integrated nanosystems. Much science waits to be discovered in the process. Nanoscale integration extends from the synthesis and fabrication of individual nanoscale building blocks, to the assembly of these building blocks into composite structures, and finally to the formation of complex functional systems. As illustrated in Figure 1, the building blocks may be homogeneous or heterogeneous, the composite materials may be nanocomposite or patterned structures, and the functional systems will involve additional combinations of materials. Nanoscale integration involves assembling diverse nanoscale materials across length scales to design and achieve new properties and functionality. At each stage size-dependent properties, the influence of surfaces in close proximity, and a multitude of interfaces all come into play. Whether the final system involves coherent electrons in a quantum computing approach, the combined flow of phonons and electrons for a high efficiency thermoelectric micro-generator, or a molecular recognition structure for bio-sensing, the combined effects of size, surface, and interface will be critical. In essence, one wants to combine the novel functions available through nanoscale science to achieve unique multi-functionalities not available in bulk materials. Perhaps the best-known example of integration is that of combining electronic components together into very large scale integrated circuits (VLSI). The integrated circuit has revolutionized electronics in many ways, from exploiting field-effect transistor devices and low power complementary logic to enable the electronic watch and hand calculator in the 1970's, to today's microprocessors and memories with billions of devices and a computational power not imagined a few decades ago. The manipulation of charges on a chip, the new concepts in combining devices for logic functions, and the new approaches to computation, information processing, and imaging have all emerged from Kilby and Noyce's simple concept of integrating devices on a single chip. Moving from hard to soft materials, a second more recent example of integration is the DNA microarray. These microarrays, with up to millions of elements in a planar array that can be optically read out, can simultaneously measure the expression of 10's of thousands of genes to study the effects of disease and treatment, or screen for single nucleotide polymorphisms for uses ranging from forensics to predisposition to disease. While still at an early stage, microarrays have revolutionized biosciences by providing the means to interrogate the complex genetic control of biological functions. Just as integrated circuits and microarrays have led to completely new functionalities and performance, the integration of nanoscale materials and structures is anticipated to lead to new performance and enable the design of new functionalities not previously envisioned. The fundamental questions underlying integration go beyond just complex fabrication or the engineering of known solutions; they lead to new discoveries and new science. The scientific challenges around nanoscale integration necessitate the development of new knowledge that is central to the advance of nanotechnology. To move forward one must address key science questions that arise in nanoscience integration and go beyond a single system or materials area. New science and discoveries especially await around three questions. How does one: (1) Control energy transfer and other interactions across interfaces and over mUltiple length scales? (2) Understand and control the interactions between nanoscale building blocks to assemble specific integrated structures? (3) Design and exploit interactions within assembled structures to achieve new properties and specific functionalities? These high level questions can serve to drive research, and to advance understanding of the complex phenomena and multifunctionality that may emerge from integration. For example, in photonics there is considerable effort to understand and control the response of nanoscale conducting structures on dielectrics, to allow one to localize, manipulate, and control electromagnetic energy in integrated systems such as in the field known as metamaterials. Essential to this area is a fundamental understanding of energy transfer across multiple length scales (question 1 above).

77 NANOSCIENCE AND NANOTECHNOLOGY↗

NISQ+: Boosting quantum computing power by approximating quantum error correction

Quantum computers are growing in size, and design decisions are being made now that attempt to squeeze more computation out of these machines. In this spirit, we design a method to boost the computational power of near-term quantum computers by adapting protocols used in quantum error correction to implement "Approximate Quantum Error Correction (AQEC)." By approximating fully-fledged error correction mechanisms, we can increase the compute volume (qubits × gates, or "Simple Quantum Volume (SQV)") of near-term machines. The crux of our design is a fast hardware decoder that can approximately decode detected error syndromes rapidly. Specifically, we demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems by designing and implementing a novel algorithm in Single-Flux Quantum (SFQ) superconducting logic technology. This avoids a critical decoding backlog, hidden in all offline decoding schemes, that leads to idle time exponential in the number of T gates in a program. Our design utilizes one SFQ processing module per physical qubit. Employing state-of-the-art SFQ synthesis tools, we show that the circuit area, power, and latency are within the constraints of contemporary quantum system designs. Under pure dephasing error models, the proposed accelerator and AQEC solution is able to expand SQV by factors between 3,402 and 11,163 on expected near-term machines. The decoder achieves a 5% accuracy-threshold and pseudo-thresholds of ~ 5%,4.75%,4.5%, and 3.5% physical error-rates for code distances 3,5,7, and 9. Decoding solutions are achieved in a maximum of ~20 nanoseconds on the largest code distances studied. By avoiding the exponential idle time in offline decoders, we achieve a 10x reduction in required code distances to achieve the same logical performance as alternative designs.

97 MATHEMATICS AND COMPUTING↗

Unitary circuit synthesis for tomography of generalized coherent states

We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables. Such expectations can be estimated by performing projective measurements on $\mathcal{O}$(M 3 log(M/δ)/ε 2 ) copies of the state, where M is the dimension of an associated Lie algebra, ε is a precision parameter, and 1 - δ is the required confidence level. The method can be implemented on a classical computer and runs in time $\mathcal{O}$(M 4 log(M/ε)). It provides $\mathcal{O}$(Mlog(M/ε)) simple unitaries that form the sequence. The overall complexity is then polynomial in M, being very efficient in cases where M is significantly smaller than the Hilbert space dimension, as for some fermion algebras. When the algebra of relevant observables is given by certain Pauli matrices, each simple unitary may be easily decomposed into two-qubit gates. We discuss applications to efficient quantum state tomography and classical simulations of quantum circuits. $\mathcal{O}$

97 MATHEMATICS AND COMPUTING↗

CARBON NANOTUBES: PROPERTIES AND APPLICATIONS

Carbon nanotubes were discovered in 1991 as a minority byproduct of fullerene synthesis. Remarkable progress has been made in the ensuing years, including the discovery of two basic types of nanotubes (single-wall and multi-wall), great strides in synthesis and purification, elucidation of many fundamental physical properties, and important steps towards practical applications. Both the underlying science and technological potential of SWNT can profitably be studied at the scale of individual tubes and on macroscopic assemblies such as fibers. Experiments on single tubes directly reveal many of the predicted quantum confinement and mechanical properties. Semiconductor nanowires have many features in common with nanotubes, and many of the same fundamental and practical issues are in play – quantum confinement and its effect on properties; possible device structures and circuit architectures; thermal management; optimal synthesis, defect morphology and control, etc. In 2000 we began a small effort in this direction, conducted entirely by undergraduates with minimal consumables support from this grant. With DOE-BES approval, this grew into a project in parallel with the carbon nanotube work, in which we studied of inorganic semiconductor nanowire growth, characterization and novel strategies for electronic and electromechanical device fabrication. From the beginnings of research on carbon nanotubes, one of the major applications envisioned was hydrogen storage for fuel-cell powered cars and trucks. Subsequent theoretical models gave mixed results, the most pessimistic indicating that the fundamental H2-SWNT interaction was similar to flat graphite (physisorption) with only modest binding energies implying cryogenic operation at best. New material families with encouraging measured properties have emerged, and materials modeling has gained enormously in predictive power, sophistication, and the ability to treat a realistically representative number of atoms. One of the new materials, highly porous carbide-derived carbons (CDC), is the subject of an add-on to this grant awarded to myself and Taner Yildirim (NIST). Results from the add-on led eventually to a new 3-year award DE-FG02-08ER46522 “From Fundamental Understanding to Predicting New Nanomaterials for High Capacity Hydrogen Storage”, $1000K, (05/31/2008 - 05/01/2011) with Taner Yildirim and myself as co-PI’s.

08 HYDROGEN↗