Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
about
Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction.Statistical Analysis for Collision-free Boson Sampling.Linear and Logarithmic Time Compositions of Quantum Many-Body Operators.Continuous-Variable Instantaneous Quantum Computing is Hard to Sample.Measurement-based classical computation.Implementation of universal quantum gates based on nonadiabatic geometric phases.Geometric quantum computation using nuclear magnetic resonanceStringent and efficient assessment of boson-sampling devices.Research on palmprint identification method based on quantum algorithms.Boson sampling for molecular vibronic spectraOptimal local implementation of nonlocal quantum gatesQUANTUM DISCORD AS A RESOURCE IN QUANTUM COMMUNICATIONRobust Ising gates for practical quantum computationTackling systematic errors in quantum logic gates with composite rotationsHolevo's bound from a general quantum fluctuation theoremHarnessing the power of quantum systems based on spin magnetic resonance: from ensembles to single spinsAn efficient quantum blind digital signature schemeA Comparative Evaluation of Algorithms in the Implementation of an Ultra-Secure Router-to-Router Key Exchange SystemAn Efficient Code-Based Threshold Ring Signature Scheme with a Leader-Participant ModelUniversality of quantum Turing machines with deterministic control
P2860
Q41159231-85EAC6A8-8BB4-444F-9DAA-5844F41F4914Q45920770-626D9AB8-B42D-4229-BA93-7BE1A521AF1CQ50219851-AC8DA954-BB95-489F-B4CD-5BCCF3532F28Q51565354-1F10EE9C-C1BD-4F1D-89D6-59A048C4A7FEQ51589915-16287EE5-CEBC-43B2-B898-093177BBB41BQ51640823-C7C0C0F3-FD12-47F4-A507-14A4DEB915BEQ51645474-F4E5485A-5BA3-4A97-BA78-DAECF7634415Q53491587-3D4ACFAD-1B10-4F84-91C9-D1866A25CE64Q55636705-D7D5B8DB-6191-4498-9078-0E585F167C68Q56689374-E3E360B1-47EA-4AE9-A355-B24038D95E9BQ57637322-8798BDAD-1CB5-4279-B9F4-994694ADFCFEQ57741547-38D372BE-EA8D-43EA-BCFD-0F9882B094DDQ57908587-FDC4D568-7DC1-47B3-A5A2-A4EA8770FF66Q57908590-B2DB8716-45EB-4DF7-8EE9-9C5719B5E0D0Q58022390-EDA42099-B03A-4B35-91D8-68188A48A857Q58094121-64B9B292-903C-42F3-97B6-5B3CEA5A36BAQ58184585-23B27DFF-6631-4061-AA6D-E353AC6E9B91Q59147975-38A87EF8-DBDB-42B3-A6D3-B493EA30832EQ59147981-121B62E8-8AD0-48A5-850A-C69F1EB3CAA0Q59196613-77CE794C-0691-4496-B7DA-F7C018A56029
P2860
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
description
im Jahr 1999 veröffentlichter wissenschaftlicher Artikel
@de
scientific article published in 1999
@en
наукова стаття, опублікована в січні 1999
@uk
name
Polynomial-Time Algorithms for ...... garithms on a Quantum Computer
@en
type
label
Polynomial-Time Algorithms for ...... garithms on a Quantum Computer
@en
prefLabel
Polynomial-Time Algorithms for ...... garithms on a Quantum Computer
@en
P1433
P1476
Polynomial-Time Algorithms for ...... garithms on a Quantum Computer
@en
P304
P356
10.1137/S0036144598347011
P407
P50
P577
1999-01-01T00:00:00Z