Thematische Bibliographien / Shor Algorithm

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Shor Algorithm“

Autor: Grafiati
Veröffentlicht am 28. Juni 2021
Zuletzt aktualisiert am 3. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Shor Algorithm" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Shor Algorithm"

1

Monz, T., D. Nigg, E. A. Martinez, et al. "Realization of a scalable Shor algorithm." Science 351, no. 6277 (2016): 1068–70. http://dx.doi.org/10.1126/science.aad9480.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Cherckesova, Larissa, Olga Safaryan, Pavel Razumov, Irina Pilipenko, Yuriy Ivanov, and Ivan Smirnov. "Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part." E3S Web of Conferences 224 (2020): 01016. http://dx.doi.org/10.1051/e3sconf/202022401016.

Der volle Inhalt der Quelle
Annotation:
This report discusses Shor’s quantum factorization algorithm and ρ–Pollard’s factorization algorithm. Shor’s quantum factorization algorithm consists of classical and quantum parts. In the classical part, it is proposed to use Euclidean algorithm, to find the greatest common divisor (GCD), but now exist large number of modern algorithms for finding GCD. Results of calculations of 8 algorithms were considered, among which algorithm with lowest execution rate of task was identified, which allowed the quantum algorithm as whole to work faster, which in turn provides greater potential for practica
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

AVILA, M. A. "MINIMAL EXECUTION TIME OF SHOR'S ALGORITHM AT LOW TEMPERATURES." International Journal of Quantum Information 07, no. 01 (2009): 287–96. http://dx.doi.org/10.1142/s0219749909004475.

Der volle Inhalt der Quelle
Annotation:
The minimal time, T Shor , in which a one-way quantum computer can execute Shor's algorithm is derived. In the absence of an external magnetic field, this quantity diverges at very small temperatures. This result coincides with that of Anders et al. obtained simultaneously to ours but using thermodynamical arguments. Such divergence contradicts the common belief that it is possible to do quantum computation at low temperatures. It is shown that in the presence of a weak external magnetic field, T Shor becomes a quantized quantity which vanishes at zero temperature. Decoherence is not a problem
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lerner, E. Yu. "Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm." Russian Mathematics 52, no. 12 (2008): 36–40. http://dx.doi.org/10.3103/s1066369x08120062.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Hlukhov, V. "CAPACITIVE COMPLEXITY OF DETERMINING GCD IN THE SHOR S ALGORITHM." ELECTRICAL AND COMPUTER SYSTEMS 33, no. 108 (2020): 26–32. http://dx.doi.org/10.15276/eltecs.32.108.2020.3.

Der volle Inhalt der Quelle
Annotation:
The article analyzes the results of finding the period r of the function y = axmodM (a is a random number) which is used in the Shor's factorization algorithm for quantum computers. The module M is the product of two primes p and q. The article analyzes the solutions r obtained for various a, for which the capacitive complexity H of finding the greatest common divisor GCD(ar/2 + 1, M) is the least. A digital quantum computer is a classic processor and its digital quantum coprocessor. A digital quantum coprocessor with hundreds and thousands of digital qubits can be implemented in one programma
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Ekerå, Martin. "On post-processing in the quantum algorithm for computing short discrete logarithms." Designs, Codes and Cryptography 88, no. 11 (2020): 2313–35. http://dx.doi.org/10.1007/s10623-020-00783-2.

Der volle Inhalt der Quelle
Annotation:
Abstract We revisit the quantum algorithm for computing short discrete logarithms that was recently introduced by Ekerå and Håstad. By carefully analyzing the probability distribution induced by the algorithm, we show its success probability to be higher than previously reported. Inspired by our improved understanding of the distribution, we propose an improved post-processing algorithm that is considerably more efficient, enables better tradeoffs to be achieved, and requires fewer runs, than the original post-processing algorithm. To prove these claims, we construct a classical simulator for
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Kiseliova, O. M., O. M. Prytomanova, and V. H. Padalko. "APPLICATION OF THE THEORY OF OPTIMAL SET PARTITIONING BEFORE BUILDING MULTIPLICATIVELY WEIGHTED VORONOI DIAGRAM WITH FUZZY PARAMETERS." EurasianUnionScientists 6, no. 2(71) (2020): 30–35. http://dx.doi.org/10.31618/esu.2413-9335.2020.6.71.615.

Der volle Inhalt der Quelle
Annotation:
An algorithm for constructing a multiplicatively weighted Voronoi diagram involving fuzzy parameters with the optimal location of a finite number of generator points in a limited set of n-dimensional Euclidean space 𝐸𝑛 has been suggested in the paper. The algorithm has been developed based on the synthesis of methods of solving the problems of optimal set partitioning theory involving neurofuzzy technologies modifications of N.Z. Shor 𝑟 -algorithm for solving nonsmooth optimization problems.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Plesa, Mihail-Iulian, and Togan Mihai. "A New Quantum Encryption Scheme." Advanced Journal of Graduate Research 4, no. 1 (2018): 59–67. http://dx.doi.org/10.21467/ajgr.4.1.59-67.

Der volle Inhalt der Quelle
Annotation:
The model of quantum computation has advanced very quickly in the last years. This model brings with it an efficient algorithm for factoring, namely the Shor algorithm. This means that the public key infrastructure will soon be obsolete. In this paper we propose a new quantum cryptographic scheme which aims to replace the RSA algorithm from current public key infrastructures. We analyze the security of our scheme and also, we describe the implementation of the scheme using IBM Q SDK, qiskit. We run a number of experiments in order to build a proof of concept application that uses the proposed
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ghisi, F., and S. V. Ulyanov. "The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics." Journal of Modern Optics 47, no. 12 (2000): 2079–90. http://dx.doi.org/10.1080/09500340008235130.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Ulyanov, F. Ghisi, S. V. "The information role of entanglement and interference operators in Shor quantum algorithm gate dynamics." Journal of Modern Optics 47, no. 12 (2000): 2079–90. http://dx.doi.org/10.1080/095003400419933.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Shor Algorithm"

1

MARTINS, ROBERTO CINTRA. "SHOR S FACTORING ALGORITHM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35511@1.

Der volle Inhalt der Quelle
Annotation:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>A dissertação apresenta detalhadamente o algoritmo de fatoração de Shor, tanto em termos de sua execução passo a passo como mediante sua representação em forma de circuito, abordando aspectos tanto de sua parte clássica como de sua parte quântica. Inicialmente são apresentados aspectos de teoria dos números indispensáveis para a compreensão do algoritmo e em seguida são desenvolvidos conceitos e propriedades de mecânica quântica e de informação quântica pertinentes. Em atenção ao caráter eminentemente estocástico do algoritmo realiza-se um
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Nwaokocha, Martyns. "Shorův algoritmus v kvantové kryptografii." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-445457.

Der volle Inhalt der Quelle
Annotation:
Kryptografie je velmi důležitým aspektem našeho každodenního života, protože poskytuje teoretický základ informační bezpečnosti. Kvantové výpočty a informace se také stávají velmi důležitou oblastí vědy kvůli mnoha aplikačním oblastem včetně kryptologie a konkrétněji v kryptografii veřejných klíčů. Obtížnost čísel do hlavních faktorů je základem některých důležitých veřejných kryptosystémů, jejichž klíčem je kryptosystém RSA . Shorův kvantový faktoringový al-goritmus využívá zejména kvantový interferenční účinek kvantového výpočtu k faktorovým semi-prime číslům v polynomiálním čase na kvantové
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Der volle Inhalt der Quelle
Annotation:
<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Drobouchevitch, Inna G. "Design and analysis of algorithms for short-route shop scheduling problems." Thesis, University of Greenwich, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285392.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Blum, Christian. "Metaheuristics for Group Shop Scheduling." Doctoral thesis, Universite Libre de Bruxelles, 2002. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211345.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Ta, Quang-Chieu. "Matheuristic algorithms for minimizing total tardiness in flow shop scheduling problems." Thesis, Tours, 2015. http://www.theses.fr/2015TOUR4002/document.

Der volle Inhalt der Quelle
Annotation:
Nous considérons dans cette thèse un problème d’ordonnancement de flow-shop de permutation où un ensemble de travaux doit être ordonnancé sur un ensemble de machines. Les travaux doivent être ordonnancés sur les machines dans le même ordre. L’objectif est de minimiser le retard total. Nous proposons des algorithmes heuristiques et des nouvelles matheuristiques pour ce problème. Les matheuristiques sont un nouveau type d’algorithmes approchés qui ont été proposés pour résoudre des problèmes d’optimisation combinatoire. Les méthodes importent de la résolution exacte au sein des approches (méta)
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Bandini, Michele. "Crittografia quantistica e algoritmo di Shor." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17073/.

Der volle Inhalt der Quelle
Annotation:
In questo elaborato si cerca di dare un'idea di come funzioni un computer quantistico, portando come esempio l'Algoritmo di Shor per la fattorizzazione: si cerca di chiarirne la matematica e la fisica che vi stanno dietro e l'importanza applicativa e storica che ha avuto. Brevi cenni sull'odierna tecnologia dei calcolatori quantistici.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Kugel, Felix. "Das Shor-Verfahren als stochastischer Algorithmus." [S.l.] : [s.n.], 2006. http://137.193.200.177/ediss/kugel-felix/meta.html.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Weyer, Anne. "The Brute Force Algorithm." Bowling Green State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1555605680617133.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Larabi, Mohand. "Le problème de job-shop avec transport : modélisation et optimisation." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2010. http://tel.archives-ouvertes.fr/tel-00625528.

Der volle Inhalt der Quelle
Annotation:
Dans cette thèse nous nous sommes intéressés à l'extension du problème job-shop en ajoutant la contrainte du transport des jobs entre les différentes machines. Dans cette étude nous avons retenu l'existence de deux types de robots, les robots de capacité de chargement unitaire (capacité=1 veut dire qu'un robot ne peut transporter qu'un seul job à la fois) et les robots de capacité de chargement non unitaire (capacité>1 veut dire qu'un robot peut transporter plusieurs job à la fois). Nous avons traité cette extension en deux étapes. Ainsi, la première étape est consacrée au problème du job-shop
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Shor Algorithm"

1

Song, Yingsheng. Genetic algorithms for job shop scheduling. The Author], 2002.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Asquith, Paul. Short sales and trade classification algorithms. National Bureau of Economic Research, 2008.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

George, Vairaktarakis, ed. Flow shop scheduling: Theoretical results, algorithms, and applications. Springer Verlag, 2013.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Dapporto, Paolo, Paola Paoli, Patrizia Rossi, and Annalisa Guerri. The UTN program. Firenze University Press, 2001. http://dx.doi.org/10.36253/88-8453-032-6.

Der volle Inhalt der Quelle
Annotation:
We give an algorithm which goal is to find the energy barrier between a given pair of points in a graph which represents the conformational space of a molecule. If the conformational space is homeomorphic to an -dimensional torus, then the graph can be chosen of a particular form. The UTN software, which implements the algorithm in this case, is described in detail. Finally we focus on applications: to show how UTN works, some examples are carried on in detail, with the additional support of graphical animation1 in the twodimensional case. The source code of the program and some data of the ex
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Burstein, Joseph. Exact numerical solutions of nonlinear differential equations, short algorithms: After three centuries of approximate methods. Metrics Press, 2002.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Jin tian bu xue ji qi xue xi, ming tian jiu bei ji qi qu dai: Cong Python ru shou + yan suan fa. Jia kui zi xun fa xing, 2017.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

1974-, Zomorodian Afra J., ed. Advances in applied and computational topology: American Mathematical Society Short Course on Computational Topology, January 4-5, 2011, New Orleans, Louisiana. American Mathematical Society, 2012.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Daji, Qiao, and SpringerLink (Online service), eds. Quality, Reliability, Security and Robustness in Heterogeneous Networks: 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers. Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Tschinkel, Yuri, Carlo Gasbarri, Steven Lu, and Mike Roth. Rational points, rational curves, and entire holomorphic curves on projective varieties: CRM short thematic program, June 3-28, 2013, Centre de Recherches Mathematiques, Universite de Montreal, Quebec, Canada. American Mathematical Society, 2015.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Levitin, Anany, and Maria Levitin. Algorithmic Puzzles. Oxford University Press, 2011. http://dx.doi.org/10.1093/oso/9780199740444.001.0001.

Der volle Inhalt der Quelle
Annotation:
While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Shor Algorithm"

1

LaPierre, Ray. "Shor Algorithm." In The Materials Research Society Series. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69318-3_13.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Raj, Gaurav, Dheerendra Singh, and Abhishek Madaan. "Analysis of Classical and Quantum Computing Based on Grover and Shor Algorithm." In Smart Computing and Informatics. Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-5547-8_43.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-03612-9_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-03088-2_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04550-3_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Brucker, Peter. "Shop Scheduling Problems." In Scheduling Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24804-0_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

van Heerdt, Gerco, Clemens Kupke, Jurriaan Rot, and Alexandra Silva. "Learning Weighted Automata over Principal Ideal Domains." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_31.

Der volle Inhalt der Quelle
Annotation:
AbstractIn this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal $$\mathtt {L}^{\!\star }$$ L ⋆ algorithm works when the semiring is a principal ideal domain, but not for general semirings such as the natural numbers.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Amram, Gal, Suguman Bansal, Dror Fried, Lucas Martinelli Tabajara, Moshe Y. Vardi, and Gera Weiss. "Adapting Behaviors via Reactive Synthesis." In Computer Aided Verification. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_41.

Der volle Inhalt der Quelle
Annotation:
AbstractIn the Adapter Design Pattern, a programmer implements a Target interface by constructing an Adapter that accesses an existing Adaptee code. In this work, we present a reactive synthesis interpretation to the adapter design pattern, wherein an algorithm takes an Adaptee and a Target transducers, and the aim is to synthesize an Adapter transducer that, when composed with the Adaptee, generates a behavior that is equivalent to the behavior of the Target. One use of such an algorithm is to synthesize controllers that achieve similar goals on different hardware platforms. While this problem can be solved with existing synthesis algorithms, current state-of-the-art tools fail to scale. To cope with the computational complexity of the problem, we introduce a special form of specification format, called Separated GR(k), which can be solved with a scalable synthesis algorithm but still allows for a large set of realistic specifications. We solve the realizability and the synthesis problems for Separated GR(k), and show how to exploit the separated nature of our specification to construct better algorithms, in terms of time complexity, than known algorithms for GR(k) synthesis. We then describe a tool, called SGR(k), that we have implemented based on the above approach and show, by experimental evaluation, how our tool outperforms current state-of-the-art tools on various benchmarks and test-cases.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Mattfeld, Dirk C. "Evolutionary Algorithms." In Evolutionary Search and the Job Shop. Physica-Verlag HD, 1996. http://dx.doi.org/10.1007/978-3-662-11712-5_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Bagchi, Tapan P. "Job Shop Scheduling." In Multiobjective Scheduling by Genetic Algorithms. Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5237-6_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Shor Algorithm"

1

Yimsiriwattana, Anocha, and Samuel J. Lomonaco Jr. "Distributed quantum computing: a distributed Shor algorithm." In Defense and Security, edited by Eric Donkor, Andrew R. Pirich, and Howard E. Brandt. SPIE, 2004. http://dx.doi.org/10.1117/12.546504.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Zhang, Xin, YaQian Zhao, RenGang Li, et al. "The Quantum Shor Algorithm Simulated on FPGA." In 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom). IEEE, 2019. http://dx.doi.org/10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00082.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Chuang, Issac. "Experimental realization of a Shor-type quantum algorithm." In International Conference on Quantum Information. OSA, 2001. http://dx.doi.org/10.1364/icqi.2001.fqipa3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Young, Rupert, Philip Birch, and Chris Chatwin. "A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform." In Pattern Recognition and Tracking XXIX, edited by Mohammad S. Alam. SPIE, 2018. http://dx.doi.org/10.1117/12.2309468.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

CHOFFRUT, CHRISTIAN. "A SHORT INTRODUCTION TO AUTOMATIC GROUP THEORY." In Semigroups, Algorithms, Automata and Languages. WORLD SCIENTIFIC, 2002. http://dx.doi.org/10.1142/9789812776884_0004.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Li, Qinbin, Bingsheng He, and Dawn Song. "Practical One-Shot Federated Learning for Cross-Silo Setting." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/205.

Der volle Inhalt der Quelle
Annotation:
Federated learning enables multiple parties to collaboratively learn a model without exchanging their data. While most existing federated learning algorithms need many rounds to converge, one-shot federated learning (i.e., federated learning with a single communication round) is a promising approach to make federated learning applicable in cross-silo setting in practice. However, existing one-shot algorithms only support specific models and do not provide any privacy guarantees, which significantly limit the applications in practice. In this paper, we propose a practical one-shot federated lea
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Scott, David, and L. A. Thomsen. "A Global Algorithm for Pore Pressure Prediction." In Middle East Oil Show. Society of Petroleum Engineers, 1993. http://dx.doi.org/10.2118/25674-ms.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Morris, Christopher, Matthias Fey, and Nils Kriege. "The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/618.

Der volle Inhalt der Quelle
Annotation:
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool for (supervised) machine learning with graphs and relational data. Here, we give a comprehensive overview of the algorithm's use in a machine learning setting. We discuss the theoretical background, show how to use it for supervised graph- and node classification, discuss recent extensions, and its connection to neural architectures. Moreover, we give an overview of current applications and future directions to stimul
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ambainis, Andris. "Quantum algorithms a decade after shor." In the thirty-sixth annual ACM symposium. ACM Press, 2004. http://dx.doi.org/10.1145/1007352.1007354.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Snover, Matthew, Bonnie Dorr, and Richard Schwartz. "A lexically-driven algorithm for disfluency detection." In HLT-NAACL 2004: Short Papers. Association for Computational Linguistics, 2004. http://dx.doi.org/10.3115/1613984.1614024.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Shor Algorithm"

1

Cao, Zhengjun, Lihua Liu, and Andreas Christoforides. A Note on One Realization of a Scalable Shor Algorithm. Web of Open Science, 2020. http://dx.doi.org/10.37686/qrl.v1i2.81.

Der volle Inhalt der Quelle
Annotation:
Very recently, Monz, et al. have reported the demonstration of factoring 15 using a scalable Shor algorithm with an ion-trap quantum computer. In this note, we remark that the report is somewhat misleading because there are three flaws in the proposed circuit diagram of Shor algorithm. We also remark that the principles behind the demonstration have not been explained properly, including its correctness and complexity.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Guliashki, Vassil, and Leoneed Kirilov. Algorithm Generating Initial Population of Schedules for Population-based Algorithms Solving Flexible Job Shop Problems. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2019. http://dx.doi.org/10.7546/crabs.2019.06.01.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Asquith, Paul, Rebecca Oman, and Christopher Safaya. Short Sales and Trade Classification Algorithms. National Bureau of Economic Research, 2008. http://dx.doi.org/10.3386/w14158.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Jones, Peter W., Andrei Osipov, and Vladimir Rokhlin. A Randomized Approximate Nearest Neighbors Algorithm - A Short Version. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada639824.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Plimpton, S. Fast parallel algorithms for short-range molecular dynamics. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10176421.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Allende López, Marcos, Diego López, Sergio Cerón, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003313.

Der volle Inhalt der Quelle
Annotation:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Cable, S., T. Tajima, and K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/6970874.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Cable, S., T. Tajima, and K. Umegaki. Particle simulation algorithms with short-range forces in MHD and fluid flow. Office of Scientific and Technical Information (OSTI), 1992. http://dx.doi.org/10.2172/10181739.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Downard, Alicia, Stephen Semmens, and Bryant Robbins. Automated characterization of ridge-swale patterns along the Mississippi River. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/40439.

Der volle Inhalt der Quelle
Annotation:
The orientation of constructed levee embankments relative to alluvial swales is a useful measure for identifying regions susceptible to backward erosion piping (BEP). This research was conducted to create an automated, efficient process to classify patterns and orientations of swales within the Lower Mississippi Valley (LMV) to support levee risk assessments. Two machine learning algorithms are used to train the classification models: a convolutional neural network and a U-net. The resulting workflow can identify linear topographic features but is unable to reliably differentiate swales from o
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Allen, Luke, Joon Lim, Robert Haehnel, and Ian Dettwiller. Helicopter rotor blade multiple-section optimization with performance. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41031.

Der volle Inhalt der Quelle
Annotation:
This paper presents advancements in a surrogate-based, rotor blade design optimization framework for improved helicopter performance. The framework builds on previous successes by allowing multiple airfoil sections to designed simultaneously to minimize required rotor power in multiple flight conditions. Rotor power in hover and forward flight, at advance ratio 𝜇 = 0.3, are used as objective functions in a multi-objective genetic algorithm. The framework is constructed using Galaxy Simulation Builder with optimization provided through integration with Dakota. Three independent airfoil sections
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Shor Algorithm" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie