MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits (Q6089492): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11128-023-04142-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4387704564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of reversible circuits and their quantum implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank

Latest revision as of 12:53, 3 August 2024

scientific article; zbMATH DE number 7763936
Language Label Description Also known as
English
MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
scientific article; zbMATH DE number 7763936

    Statements

    MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2023
    0 references
    quantum circuit
    0 references
    MPMCT gate
    0 references
    T-depth
    0 references
    Toffoli-depth
    0 references

    Identifiers