Quantum circuits for qubit fusion

Moussa, Jonathan Edward

Title: Quantum circuits for qubit fusion

Full Record
Other Related Research

Abstract

In this article, we consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Cli ord operators. This introduces a nesting, C²₁ C C⁴₂ C C²₃, where C^m_n is the n^th level of the m-dimensional qudit Cli ord hierarchy. If we can convert between logical qubits and qudits, then qudit Cli ord operators are qubit non-Cli ord operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a fault-tolerant state preparation using stabilizer circuits.

Authors:

Moussa, Jonathan Edward ^[1]

Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Center for Computing Research

Publication Date:: Tue Dec 01 00:00:00 EST 2015

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1338340

Report Number(s):: SAND-2015-11052J
Journal ID: ISSN 1533-7146; 617373

Grant/Contract Number:: AC04-94AL85000

Resource Type:: Accepted Manuscript

Journal Name:: Quantum Information & Computation

Additional Journal Information:: Journal Volume: 16; Journal Issue: 13-14; Journal ID: ISSN 1533-7146

Publisher:: Rinton Press

Country of Publication:: United States

Language:: English

Subject:: 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS

Citation Formats


                    Moussa, Jonathan Edward. Quantum circuits for qubit fusion.  United States: N. p., 2015. 
Web.

Copy to clipboard


                    Moussa, Jonathan Edward. Quantum circuits for qubit fusion.  United States.

Copy to clipboard


                    Moussa, Jonathan Edward. Tue .  
"Quantum circuits for qubit fusion".  United States.  https://www.osti.gov/servlets/purl/1338340.

Copy to clipboard


                    
@article{osti_1338340,

  title        = {Quantum circuits for qubit fusion},

  author       = {Moussa, Jonathan Edward},

  abstractNote = {In this article, we consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Cli ord operators. This introduces a nesting, C21 C C42 C C23, where Cmn is the nth level of the m-dimensional qudit Cli ord hierarchy. If we can convert between logical qubits and qudits, then qudit Cli ord operators are qubit non-Cli ord operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a fault-tolerant state preparation using stabilizer circuits.},

  doi          = {},

  journal      = {Quantum Information & Computation},

  number       = 13-14,

  volume       = 16,

  place        = {United States},

  year         = {Tue Dec 01 00:00:00 EST 2015},

  month        = {Tue Dec 01 00:00:00 EST 2015}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

The DOI is not currently available

Other availability

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Qubit-efficient entanglement spectroscopy using qubit resets

Journal Article Yirka, Justin ; Subaşı, Yiğit - Quantum

One smore »« less
https://doi.org/10.22331/q-2021-09-02-535
Surface Code Compilation via Edge-Disjoint Paths

Journal Article Beverland, Michael ; Kliuchnikov, Vadym ; Schoute, Eddie - PRX Quantum

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a two-dimensional grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit’s qubits in surface codes can result in long-range two-qubit operations across the grid. We show how to prepare many long-range Bell pairs on qubits connected by edge-disjoint paths of ancillae in constant depth that can be used to perform these long-range operations. This forms one core part of our edge-disjoint path compilation (EDPC) algorithm, by easily performing many parallel long-range Clifford operations in constant depth. It also allowsmore »« less
https://doi.org/10.1103/PRXQuantum.3.020342
Quantum circuits with uniformly controlled one-qubit gates

Journal Article Bergholm, Ville ; Vartiainen, Juha J ; Moettoenen, Mikko ; ... - Physical Review. A

Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type using at most 2{sup n-1}-1 controlled-NOT gates, 2{sup n-1} one-qubit gates, and a single diagonal n-qubit gate. To illustrate the versatility of these gates we then apply them to the decomposition of a general n-qubit gate and a state preparation procedure. Moreover, we study their implementation using only nearest-neighbor gates. We give upper bounds for the one-qubit and controlled-NOT gate counts for allmore »« less
https://doi.org/10.1103/PhysRevA.71.052330
Quantum Coding with Low-Depth Random Circuits

Journal Article Gullans, Michael J. ; Krastanov, Stefan ; Huse, David A. ; ... - Physical Review. X

Rmore »« less
https://doi.org/10.1103/PhysRevX.11.031066
Efficient Quantum Circuit Decompositions via Intermediate Qudits

Journal Article Baker, Jonathan M. ; Duckering, Casey ; Chong, Frederic T. - Proceedings of the International Symposium on Multiple-Valued Logic (ISMVL) (Online)

Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be resource-constrained for years to come so reducing ancilla requirements is crucial. In this work, we give a method to generate ancilia out of idle qubits by placing some in higher-value states, called qudits. Here, we show how to take a circuit with many O(n) ancilla and design an ancilla-free circuit with the same asymptotic depth. Using this, we give a circuit construction for an in-place adder and a constant adder both with O(log n)more »« less
https://doi.org/10.1109/ismvl49045.2020.9345604

Full Text Available

Similar Records