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 29. Juli 2025

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

Arya, Wicaksana, Anthony, and Wahyu Wicaksono Adjie. "Web-app realization of Shor's quantum factoring algorithm and Grover's quantum search algorithm." TELKOMNIKA Telecommunication, Computing, Electronics and Control 18, no. 3 (2020): 1319–30. https://doi.org/10.12928/TELKOMNIKA.v18i3.14755.

Der volle Inhalt der Quelle
Annotation:
Quantum algorithms are well-known for their quadratic if not exponential speedup over their classical counterparts. The two widely-known quantum algorithms are Shor’s quantum factoring algorithm and Grover’s quantum search algorithm. Shor’s quantum factoring algorithm could perform integer factorization in O(logN). Grover’s quantum search algorithm could solve the unsorted search problem in O(√N). However, both algorithms are introduced as theoretical concepts in the original papers due to the limitations of quantum technology at that time. In this paper, an impro
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

B., Muruganantham, Shamili P., Ganesh Kumar S., and Murugan A. "Quantum cryptography for secured communication networks." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 1 (2020): 407–14. https://doi.org/10.11591/ijece.v10i1.pp407-414.

Der volle Inhalt der Quelle
Annotation:
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quant
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Dai, Genting, Kaiyong He, Changhao Zhao, Yongcheng He, Jianshe Liu, and Wei Chen. "Quasi-Shor Algorithms for Global Benchmarking of Universal Quantum Processors." Applied Sciences 13, no. 1 (2022): 139. http://dx.doi.org/10.3390/app13010139.

Der volle Inhalt der Quelle
Annotation:
This work generalizes Shor’s algorithm into quasi-Shor algorithms by replacing the modular exponentiation with alternative unitary operations. By using the quantum circuits to generate Bell states as the unitary operations, a specific example called the Bell–Shor algorithm was constructed. The system density matrices in the quantum circuits with four distinct input states were calculated in ideal conditions and illustrated through chromatic graphs to witness the evolution of quantum states in the quantum circuits. For the real part of the density matrices, it was revealed that the number of ze
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

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
5

T., S. L. Radhika . T. Raja Rani. "Shor's Algorithm – ORACLE Design for Perfect Squares." Journal of Innovation Sciences and Sustainable Technologies 4, no. 1 (2024): 67–75. https://doi.org/10.0517/JISST.2024269298.

Der volle Inhalt der Quelle
Annotation:
Shor’s algorithm is a groundbreaking quantum computation method engineered to uncover the dual prime factors of an integer formed from these primes. Over the years, numerous research teams have embarked on the journey to harness this algorithm’s power. Yet, their efforts have successfully factorized numbers like 15, 21, 35, and others. This limitation arises from the challenges inherent in quantum hardware, which struggles to manage an abundance of qubits efficiently. The numbers 15, 21, and 35 share a common trait: they can be expressed as the product of two distinct prime factors
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

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
7

Monroe, Don. "A Quantum Leap in Factoring." Communications of the ACM 67, no. 6 (2024): 20–21. http://dx.doi.org/10.1145/3644101.

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

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
9

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
10

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
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

Maturo, Nicola. "Short codes for telecommand space link." Doctoral thesis, Università Politecnica delle Marche, 2016. http://hdl.handle.net/11566/243142.

Der volle Inhalt der Quelle
Annotation:
Lo scopo di questa tesi ´e studiare l’impatto di diversi algoritmi di decodifica sulle performance dei codici a correzione d’errore proposti per l’aggiornamento dello standard del telocommand link nelle missioni spaziali, che sono rappresentati dai codici Low Density Parity Check (LDPC) binari e non binari. Per la valutazione delle performance si sono considerati tre diversi modelli di canale di grande rilevanza nello comunicazioni con lo spazio, ossia: Additive White Gaussian Noise (AWGN), canale AWGN con pulsed jamming e canale AWGN con scintillazione solare; e tre diverse metriche, ossia:
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

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
9

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
10

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
Mehr Quellen

Bücher zum Thema "Shor Algorithm"

1

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
2

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

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

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

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

United States. National Aeronautics and Space Administration., ed. FNAS short term solar flare prediction algorithm: Semi-annual report, February 1, 1993 - August 1, 1993. National Aeronautics and Space Administration, 1993.

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

United States. National Aeronautics and Space Administration., ed. Development, refinement and testing of a short term solar flare pR[sic]ediction algorithm: Progress report, August 1992 - February, 1993. National Aeronautics and Space Administration, 1993.

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

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
8

United States. Environmental Protection Agency. Office of Air Quality Planning and Standards and Pacific Environmental Services, eds. Sensitivity analysis of a revised area source algorithm for the industrial source complex short term model. Office of Air Quality Planning and Standards, Office of Air and Radiation, U.S. Environmental Protection Agency, 1992.

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

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
10

John F. Kennedy Space Center., ed. Development of algorithms and error analyses for the short baseline lightning detection and ranging system. National Aeronautics and Space Administration, John F. Kennedy Space Center, 1998.

Den vollen Inhalt der Quelle finden
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

Petrenko, Alexei, and Sergei Petrenko. "Implementation of the Shor Algorithm on a Quantum Circuit." In Applied Quantum Cryptanalysis. River Publishers, 2023. http://dx.doi.org/10.1201/9781003392873-3.

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

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
4

Dierl, Simon, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, and Fredrik Tåquist. "Scalable Tree-based Register Automata Learning." In Tools and Algorithms for the Construction and Analysis of Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57249-4_5.

Der volle Inhalt der Quelle
Annotation:
AbstractExisting active automata learning (AAL) algorithms have demonstrated their potential in capturing the behavior of complex systems (e.g., in analyzing network protocol implementations). The most widely used AAL algorithms generate finite state machine models, such as Mealy machines. For many analysis tasks, however, it is crucial to generate richer classes of models that also show how relations between data parameters affect system behavior. Such models have shown potential to uncover critical bugs, but their learning algorithms do not scale beyond small and well curated experiments. In
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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
6

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
7

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
8

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
9

Nguyen, Hien Duy, Florence Forbes, Gersende Fort, and Olivier Cappé. "An Online Minorization-Maximization Algorithm." In Studies in Classification, Data Analysis, and Knowledge Organization. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-09034-9_29.

Der volle Inhalt der Quelle
Annotation:
AbstractModern statistical and machine learning settings often involve high data volume and data streaming, which require the development of online estimation algorithms. The online Expectation–Maximization (EM) algorithm extends the popular EM algorithm to this setting, via a stochastic approximation approach.We show that an online version of the Minorization–Maximization (MM) algorithm, which includes the online EM algorithm as a special case, can also be constructed in a similar manner. We demonstrate our approach via an application to the logistic regression problem and compare it to exist
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Zhang, Han, Qing Li, and Xin Yao. "Knowledge-Guided Optimization for Complex Vehicle Routing with 3D Loading Constraints." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70055-2_9.

Der volle Inhalt der Quelle
Annotation:
AbstractThe split delivery vehicle routing problem with three-dimensional loading constraints (3L-SDVRP) intertwines complex routing and packing challenges. The current study addresses 3L-SDVRP using intelligent optimization algorithms, which iteratively evolve towards optimal solutions. A pivotal aspect of these algorithms is search operators that determine the search direction and the search step size. Effective operators significantly improve algorithmic performance. Traditional operators like swap, shift, and 2-opt fall short in complex scenarios like 3L-SDVRP, mainly due to their limited
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Shor Algorithm"

1

Cho, Jaehan, Dawit Shin, Yeonjeong Hwang, and Howon Kim. "Analyze Shor Algorithm Optimization Trends and Suggest Optimization Directions." In 2024 International Conference on Platform Technology and Service (PlatCon). IEEE, 2024. https://doi.org/10.1109/platcon63925.2024.10830730.

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

J, Sathyaraj, and Sankardoss V. "Short-Term Wind Speed Forecasting using Long Shot-Term Memory Algorithms." In 2024 3rd International Conference on Automation, Computing and Renewable Systems (ICACRS). IEEE, 2024. https://doi.org/10.1109/icacrs62842.2024.10841597.

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

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
4

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
5

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
6

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
7

Li, Chengxi, Peng Cheng, and Chris Cheng. "A Comparison of Machine Learning Algorithms for Rate of Penetration Prediction for Directional Wells." In Middle East Oil, Gas and Geosciences Show. SPE, 2023. http://dx.doi.org/10.2118/213321-ms.

Der volle Inhalt der Quelle
Annotation:
Abstract One of the biggest challenges facing oil and gas companies is to lower the cost of drilling operations. The most critical parameter affecting drilling cost is the rate of penetration (ROP). Improving the ROP and reducing the drilling cycle can be significant for companies to reduce drilling costs and risks, thus enhancing market competitiveness. In the present study, we evaluate the accuracy and effectiveness of different machine learning algorithms for directional wells. We collect many field drilling datasets such as bit type, bit drilling time, revolutions per minute (RPM), weight
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Wang, Xiangzeng, Longjun Zhang, Jiaxuan Song, et al. "AI-Assisted Automation of Well Type Selection and Pad Optimization During Well Placement in Yan'an Tight Gas Reservoir." In SPE Conference at Oman Petroleum & Energy Show. SPE, 2024. http://dx.doi.org/10.2118/218670-ms.

Der volle Inhalt der Quelle
Annotation:
Abstract The Yan'an tight gas field, situated in the Ordos basin in central China, is emblematic of a typical tight gas reservoir. The field's development planning has been confronted with numerous challenges arising from conditions characterized by high geological heterogeneity, low porosity, multiple production formations, low lateral sand continuity, and a complex topography. Among the pivotal tasks in field development that necessitate addressing these challenges are the screening of well types and the optimization of pad locations. The judicious selection of well types, including horizont
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Tran, Tan D., Canh V. Pham, Dung T. K. Ha, and Phuong N. H. Pham. "Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/217.

Der volle Inhalt der Quelle
Annotation:
This work proposes an efficient parallel algorithm for non-monotone submodular maximization under a knapsack constraint problem over the ground set of size n. Our algorithm improves the best approximation factor of the existing parallel one from 8 to 7 with O(log n) adaptive complexity. The key idea of our approach is to create an alternate threshold algorithmic framework. This new strategy alternately constructs two disjoint candidate solutions within a constant number of sequence rounds. Then, the algorithm boosts solution quality without sacrificing the adaptive complexity. Extensive experi
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Alotaibi, Najd, and Serkan Dursun. "Vision Inspection of Power Lines with Deep Learning." In SPE Conference at Oman Petroleum & Energy Show. SPE, 2024. http://dx.doi.org/10.2118/218663-ms.

Der volle Inhalt der Quelle
Annotation:
Abstract The purpose of this technical paper is to introduce a novel approach to inspecting power lines using computer vision and deep learning algorithms. Traditional inspection methods are often time-consuming and costly and can be dangerous for human inspectors. This paper presents a new workflow for power line inspection that leverages machine learning algorithms to automate the process. The proposed workflow for vision inspection of power lines involves capturing high-resolution images of power lines using drones or other unmanned vehicles. These images are then processed using a deep lea
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

Baader, Franz, Jan Hladik, and Rafael Peñaloza. PSpace Automata with Blocking for Description Logics. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.157.

Der volle Inhalt der Quelle
Annotation:
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to show decidability and complexity results for basic inference problems such as satisfiability of concepts. Whereas tableau-based algorithms usually yield worst-case optimal algorithms in the case of PSpace-complete logics, it is often very hard to design optimal tableau-based algorithms for ExpTime-complete DLs. In contrast, the automata-based approach is usually well-suited to prove ExpTime upper-bounds, but its direct application will usually also yield an ExpTime-algorithm for a PSpace-complet
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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
4

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
5

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
6

Baader, Franz, Oliver Fernández Gil, and Barbara Morawska. Hybrid Unification in the Description Logic EL. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.197.

Der volle Inhalt der Quelle
Annotation:
Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the developed unification algorithms can deal with need to satisfy a certain cycle restricti
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

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
8

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
9

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Der volle Inhalt der Quelle
Annotation:
Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Tobies, Stephan. A PSpace-algorithm for ALCQI-satisfiability. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.95.

Der volle Inhalt der Quelle
Annotation:
The description logic ALCQI extends the 'standard' description logic ALC by qualifying number restrictions and converse roles. We show that concept satisfiability for this DL is still decidable in polynomial space. The presented algorithm combines techniques from [Tob99] to deal with qualifying number restrictions and from [HST99] to deal with converse roles.
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