Auswahl der wissenschaftlichen Literatur zum Thema „Algorithmie quantique“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Algorithmie quantique" 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 "Algorithmie quantique"
Pavel, Ilarion. „Les défis des technologies quantiques“. Annales des Mines - Responsabilité et environnement N° 114, Nr. 2 (10.04.2024): 81–90. http://dx.doi.org/10.3917/re1.114.0081.
Der volle Inhalt der QuelleBlais, A. „Algorithmes et architectures pour ordinateurs quantiques supraconducteurs“. Annales de Physique 28, Nr. 5 (September 2003): 1–148. http://dx.doi.org/10.1051/anphys:2003008.
Der volle Inhalt der QuelleRahman, Mohammad Arshad. „Quantile regression using metaheuristic algorithms“. International Journal of Computational Economics and Econometrics 3, Nr. 3/4 (2013): 205. http://dx.doi.org/10.1504/ijcee.2013.058498.
Der volle Inhalt der QuelleMOUNT, DAVID M., NATHAN S. NETANYAHU, CHRISTINE D. PIATKO, RUTH SILVERMAN und ANGELA Y. WU. „QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS“. International Journal of Computational Geometry & Applications 10, Nr. 06 (Dezember 2000): 593–608. http://dx.doi.org/10.1142/s0218195900000334.
Der volle Inhalt der QuelleKibzun, A. I. „Parallelization of the quantile function optimization algorithms“. Automation and Remote Control 68, Nr. 5 (Mai 2007): 799–810. http://dx.doi.org/10.1134/s0005117907050074.
Der volle Inhalt der QuellePapacharalampous, Georgia, Hristos Tyralis, Andreas Langousis, Amithirigala W. Jayawardena, Bellie Sivakumar, Nikos Mamassis, Alberto Montanari und Demetris Koutsoyiannis. „Probabilistic Hydrological Post-Processing at Scale: Why and How to Apply Machine-Learning Quantile Regression Algorithms“. Water 11, Nr. 10 (14.10.2019): 2126. http://dx.doi.org/10.3390/w11102126.
Der volle Inhalt der QuelleZheng, Songfeng. „Gradient descent algorithms for quantile regression with smooth approximation“. International Journal of Machine Learning and Cybernetics 2, Nr. 3 (22.07.2011): 191–207. http://dx.doi.org/10.1007/s13042-011-0031-2.
Der volle Inhalt der QuelleMöller, Eva, Gert Grieszbach, Bärbel Schack und Herbert Witte. „Statistical Properties and Control Algorithms of Recursive Quantile Estimators“. Biometrical Journal 42, Nr. 6 (Oktober 2000): 729–46. http://dx.doi.org/10.1002/1521-4036(200010)42:6<729::aid-bimj729>3.0.co;2-w.
Der volle Inhalt der QuelleXiang, Dao-Hong, Ting Hu und Ding-Xuan Zhou. „Approximation Analysis of Learning Algorithms for Support Vector Regression and Quantile Regression“. Journal of Applied Mathematics 2012 (2012): 1–17. http://dx.doi.org/10.1155/2012/902139.
Der volle Inhalt der QuelleCheng, Hao. „Comparison of partial least square algorithms in hierarchical latent variable model with missing data“. SIMULATION 96, Nr. 10 (30.07.2020): 825–39. http://dx.doi.org/10.1177/0037549720944467.
Der volle Inhalt der QuelleDissertationen zum Thema "Algorithmie quantique"
Remaud, Maxime. „Applications of Quantum Fourier Sampling and the Dihedral Hidden Subgroup Problem“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS326.
Der volle Inhalt der QuelleThe hidden subgroup problem (HSP) consists in finding an unknown subgroup in a group using a constant and distinct function on the cosets of this subgroup. It is of great importance in theoretical computer science and cryptography, and it turns out that quantum algorithms effectively solve some difficult instances of it. In particular, an HSP in an abelian group can be solved in polynomial time in the size of the group (a famous example is the discrete logarithm problem, solved by Shor's algorithm). Solving the HSP is essentially based on the quantum Fourier sampling technique, which inherits the properties of the quantum Fourier transform to solve problems with periodicity. In this thesis, we introduce a quantum algorithm for solving the problem of finding the shortest codeword in a random code constructed from an algorithm for decoding its dual code. This is an adaptation in Hamming metrics of a quantum reduction in Euclidean metrics of a version of the shortest vector problem to the learning-with-errors problem, which uses the quantum Fourier sampling technique and an idea due to Regev. We then recall how to solve the HSP in a dihedral group (DHSP), a problem to which many others used in post-quantum cryptography reduce, as well as the security of certain cryptosystems, such as CSIDH for example. The DHSP is in fact itself reduced to the (quantum) dihedral coset problem (DCP), for which we recall the various methods of solution. These fall into two families: the problem can be solved directly using CNOT gates and measurements (first Kuperberg algorithm), or it can be reduced to a classical subset-sum problem (Regev and second Kuperberg algorithms). We then describe a novel algorithm, inspired by the same techniques used in the reduction described above, that reduces the DCP to a quantum subset-sum problem. The resulting algorithm is the most efficient in terms of queries to the oracle inherent to the DCP. A query efficient interpolation between this new algorithm and the second Kuperberg algorithm is also presented. Finally, we explore alternative approaches to solving the DCP using less space (but potentially more oracle queries) in the spirit of Kuperberg's first algorithm
Lopez, Acevedo Olga Lucia. „Marches quantiques généralisées pour l'algorithmique quantique“. Cergy-Pontoise, 2005. http://biblioweb.u-cergy.fr/theses/05CERG0258.pdf.
Der volle Inhalt der QuelleWe have studied quantum algorithms with the purpose of calculating a matrix permanent with a quantum computer. After constructing some algorithms, we started to study the quantum equivalent of a random walk. These walks have been introduced hoping to build new quantum algorithms from them. We started by generalizing the existing model of quantum walk and started a classification of the walks defined on Cayley graphs of the simplest groups. We studied then quantum walks over the hypercube and simple lattices in one and two dimensions and we obtained an analytical expression for the wave function, in order to explore numerically quantities such as the hitting time and the variance. Finally, we also extended two existing theorems about the existence of quantum scalar walks and about the weak limit of the walk. These results enable us to consider the classification of more complex graphs with an aim of obtaining structural information on the quantum sub-algorithms that can be constructed
Lopez, Acevedo Olga. „Marches quantiques généralisées pour l'algorithmique quantique“. Phd thesis, Université de Cergy Pontoise, 2005. http://tel.archives-ouvertes.fr/tel-00169212.
Der volle Inhalt der QuelleOllivier, Harold. „Eléments de théorie de l'information quantique, décohérence et codes correcteurs quantiques“. Phd thesis, Ecole Polytechnique X, 2004. http://pastel.archives-ouvertes.fr/pastel-00001131.
Der volle Inhalt der QuelleGrospellier, Antoine. „Décodage des codes expanseurs quantiques et application au calcul quantique tolérant aux fautes“. Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS575.
Der volle Inhalt der QuelleFault tolerant quantum computation is a technique to perform reliable quantum computation using noisy components. In this context, quantum error correcting codes are used to keep the amount of errors under a sustainable threshold. One of the main problems of this field is to determine the minimum cost, in terms of memory and time, which is needed in order to transform an ideal quantum computation into a fault-tolerant one. In this PhD thesis, we show that the family of quantum expander codes and the small-set-flip decoder can be used in the construction of ref. [arXiv:1310.2984] to produce a fault-tolerant quantum circuit with constant space overhead. The error correcting code family and the decoder that we study has been introduced in ref. [arXiv:1504.00822] where an adversarial error model was examined. Based on the results of this article, we analyze quantum expander codes subjected to a stochastic error model which is relevant for fault-tolerant quantum computation [arXiv:1711.08351], [arXiv:1808.03821]. In addition, we show that the decoding algorithm can be parallelized to run in constant time. This is very relevant to prevent errors from accumulating while the decoding algorithm is running. Beyond the theoretical results described above, we perform a numerical analysis of quantum expander codes to measure their performance in practice [arXiv:1810.03681]. The error model used during these simulations generates X and Z type errors on the qubits with an independent and identically distributed probability distribution. Our results are promising because they reveal that these constant rate codes have a decent threshold and good finite length performance
Mhalla, Mehdi. „Informatique quantique, algorithmes et complexité“. Grenoble INPG, 2004. http://www.theses.fr/2004INPG0113.
Der volle Inhalt der QuelleThis work consists in several results in different domains of quantum computing. First, we propose an introduction to the quantum computing theory. Then we give efficient characterizations of entanglement for pure states. We define the full separability and the p-q separability, and give optimal algorithms that improve by a quadratic factor the detection of entanglement. The third part is dedicated to quantum game theory. We analyse some classical combinatorial games, and find an optimal strategy for the 0. 07 octal game. Then we propose a quantisation of the family of octal games, and of some other combinatorial games, defining by the way a formalism that permits to study such games. We also provide some new ideas for the study of the well know coin flip game. In the last part, we study optimisation problems, and give an optimal minima finding algorithm based on the quantum search. Then we apply this tool to design algorithms for some graph problems (connectivity, strong connectivity, minimum spanning tree and single source shortest paths. We prove the optimality of our algorithms by using the quantum adversary lower bound method, giving therefore a characherisation of the speed-up given by quantum computing for these problems
Javelle, Jérôme. „Cryptographie Quantique : Protocoles et Graphes“. Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM093/document.
Der volle Inhalt der QuelleI want to realize an optimal theoretical model for quantum secret sharing protocols based on graph states. The main parameter of a threshold quantum secret sharing scheme is the size of the largest set of players that can not access the secret. Thus, my goal is to find a collection of protocols for which the value of this parameter is the smallest possible. I also study the links between quantum secret sharing protocols and families of curves in algebraic geometry
Schrottenloher, André. „Quantum Algorithms for Cryptanalysis and Quantum-safe Symmetric Cryptography“. Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS271.
Der volle Inhalt der QuelleModern cryptography relies on the notion of computational security. The level of security given by a cryptosystem is expressed as an amount of computational resources required to break it. The goal of cryptanalysis is to find attacks, that is, algorithms with lower complexities than the conjectural bounds.With the advent of quantum computing devices, these levels of security have to be updated to take a whole new notion of algorithms into account. At the same time, cryptography is becoming widely used in small devices (smart cards, sensors), with new cost constraints.In this thesis, we study the security of secret-key cryptosystems against quantum adversaries.We first build new quantum algorithms for k-list (k-XOR or k-SUM) problems, by composing exhaustive search procedures. Next, we present dedicated cryptanalysis results, starting with a new quantum cryptanalysis tool, the offline Simon's algorithm. We describe new attacks against the lightweight algorithms Spook and Gimli and we perform the first quantum security analysis of the standard cipher AES.Finally, we specify Saturnin, a family of lightweight cryptosystems oriented towards post-quantum security. Thanks to a very similar structure, its security relies largely on the analysis of AES
Sanselme, Luc. „Algorithmes quantiques dans les groupes nilpotents“. Paris 11, 2008. http://www.theses.fr/2008PA112297.
Der volle Inhalt der QuelleWe start off this Ph. D. Thesis with giving the definition of a black-box group and reminding some algorithm associated with this group representation. Then, we put forward a new definition of a quantum black-box group. We explain precisely this new approach and we enumerate the main algorithms associated to this notion. After that, we give some algorithm of quantum computational group theory in solvable groups and in some subclasses of these solvable groups such as nilpotent groups, p-groups or extraspecial groups. Finally, we present a new result that was proved during this thesis. We show that we can solve efficiently, with a quantum computer, the hidden subgroup problem in extraspecial and nilpotent group of class 2. In addition, we give some reduction of the Hidden subgroup problem in nilpotent groups of higher classes. The last chapter of this thesis shows how to solve some system of quadratic equations over a finite field. This result is needed to solve the Hidden subgroup problem in nilpotent groups of class 2
Tapp, Alain. „Informatique quantique, algorithmes et complexité de la communication“. Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0018/NQ51978.pdf.
Der volle Inhalt der QuelleBücher zum Thema "Algorithmie quantique"
Koenker, Roger W. An interior point algorithm for nonlinear quantile regression / Roger Koenker ; Beum J. Park. Champaign: University of Illinois at Urbana-Champaign, 1992.
Den vollen Inhalt der Quelle findenChout, Philippe. Théorie du Hasard Prévisible: Heuristique Quantique des Algorithmes Stochastiques. Independently Published, 2020.
Den vollen Inhalt der Quelle findenChout, Philippe. Heuristique Quantique des Algorithmes Stochastiques: Comment Dominer le Hasard Au Jeu de la Roulette. Independently Published, 2019.
Den vollen Inhalt der Quelle findenHasard, Domine Le. Comment Dominer le Hasard Au Jeu de la Roulette: Heuristique Quantique des Algorithmes Stochastiques. Independently Published, 2019.
Den vollen Inhalt der Quelle findenHasard, Domine Le. Heuristique Quantique des Algorithmes Stochastiques: Comment Dominer le Hasard Au Jeu de la Roulette. Independently Published, 2019.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Algorithmie quantique"
Yu, Chun-Nam, Michael Crouch, Ruichuan Chen und Alessandra Sala. „Online Algorithm for Approximate Quantile Queries on Sliding Windows“. In Experimental Algorithms, 369–84. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-38851-9_25.
Der volle Inhalt der QuelleSharma, Dreamlee, und Tapan Kumar Chakrabarty. „A Quantile-Based Approach to Supervised Learning“. In Algorithms for Intelligent Systems, 321–40. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3357-0_21.
Der volle Inhalt der QuelleChen, C. „An Adaptive Algorithm for Quantile Regression“. In Theory and Applications of Recent Robust Methods, 39–48. Basel: Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7958-3_4.
Der volle Inhalt der QuellePanjwani, Shweta, S. Naresh Kumar und Laxmi Ahuja. „Bias Correction of GCM Data Using Quantile Mapping Technique“. In Algorithms for Intelligent Systems, 617–21. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5077-5_55.
Der volle Inhalt der QuelleJoseph, Ajin George, und Shalabh Bhatnagar. „A Stochastic Approximation Algorithm for Quantile Estimation“. In Neural Information Processing, 311–19. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26535-3_36.
Der volle Inhalt der QuelleChrétien, Stéphane, Oya Ekin Karaşan, Ecenur Oguz und Mustafa Ç. Pınar. „The Quantile Matching Problem and Point Cloud Registration“. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 13–20. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2021. http://dx.doi.org/10.1137/1.9781611976830.2.
Der volle Inhalt der QuelleXue, Zhengyuan. „An Effective Single-Pass Approach for Estimating the Φ-quantile in Data Streams“. In Algorithms and Architectures for Parallel Processing, 775–89. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-95384-3_48.
Der volle Inhalt der QuelleSchiefer, Nicholas, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal und Tal Wagner. „Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees“. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA23), 87–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977714.8.
Der volle Inhalt der QuelleGiacobbe, Mirco, Thomas A. Henzinger und Mathias Lechner. „How Many Bits Does it Take to Quantize Your Neural Network?“ In Tools and Algorithms for the Construction and Analysis of Systems, 79–97. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45237-7_5.
Der volle Inhalt der QuelleDas, N. C. „Bivariate Normal Distribution and Heuristic-Algorithm of BIVNOR for Generating Biquantile Pairs“. In Decision Processes by Using Bivariate Normal Quantile Pairs, 61–90. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2364-1_4.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Algorithmie quantique"
Silveira, Eduardo, Joaquim Assunção und Leonardo Emmendorfer. „Quantile Symbolic Aggregate approXimation: A guaranteed equiprobable SAX“. In Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/sbbd.2023.232421.
Der volle Inhalt der QuelleXiao, Leibing, Xinchao Wei, Yuelei Xu, Xin Xu, Kun Gong, Huafeng Li und Fan Zhang. „Truncated Quantile Critics Algorithm for Cryptocurrency Portfolio Optimization“. In 2023 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2023. http://dx.doi.org/10.1109/smc53992.2023.10393867.
Der volle Inhalt der QuelleYang, Ping, Bing Xiao, Xin Chen und Liangliang Guo. „Interval quantile maximum mutual information feature selection algorithm“. In CCEAI 2023: 2023 7th International Conference on Control Engineering and Artificial Intelligence. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3580219.3580234.
Der volle Inhalt der QuelleHuang, Zengfeng, Lu Wang, Ke Yi und Yunhao Liu. „Sampling based algorithms for quantile computation in sensor networks“. In the 2011 international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1989323.1989401.
Der volle Inhalt der QuelleHaeupler, Bernhard, Jeet Mohapatra und Hsin-Hao Su. „Optimal Gossip Algorithms for Exact and Approximate Quantile Computations“. In PODC '18: ACM Symposium on Principles of Distributed Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3212734.3212770.
Der volle Inhalt der QuelleRamirez, M., E. Tapia, M. Block und R. Rojas. „Quantile Linear Algorithm for Robust Binarization of Digitalized Letters“. In Ninth International Conference on Document Analysis and Recognition (ICDAR 2007) Vol 2. IEEE, 2007. http://dx.doi.org/10.1109/icdar.2007.4377097.
Der volle Inhalt der QuelleYang, Bei, Houkuan Huang und Zhihai Wang. „An Efficient Algorithm for Quantile Computation over Streaming Data“. In 2007 Second International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2007. http://dx.doi.org/10.1109/bicta.2007.4806436.
Der volle Inhalt der QuelleHuang, Siyu, und Tong Tian. „Prediction of Mechanical Properties of Hot Rolled Strip Based on DBN and Composite Quantile Regression“. In ACAI'21: 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3508546.3508656.
Der volle Inhalt der QuelleMalik, Jahan, Punit Kumar Shet, Dhanush Gc, Naren Karri, B. H. Kushal und Abhinay Kumar Singh. „Road Surface recognition by using Quantile Transformation and ML Algorithms“. In 2022 IEEE 3rd Global Conference for Advancement in Technology (GCAT). IEEE, 2022. http://dx.doi.org/10.1109/gcat55367.2022.9971969.
Der volle Inhalt der QuelleCui, Yufei, Ziquan Liu, Wuguannan Yao, Qiao Li, Antoni B. Chan, Tei-wei Kuo und Chun Jason Xue. „Fully Nested Neural Network for Adaptive Compression and Quantization“. In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/288.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Algorithmie quantique"
Over, Thomas, Riki Saito, Andrea Veilleux, Padraic O’Shea, Jennifer Sharpe, David Soong und Audrey Ishii. Estimation of Peak Discharge Quantiles for Selected Annual Exceedance Probabilities in Northeastern Illinois. Illinois Center for Transportation, Juni 2016. http://dx.doi.org/10.36501/0197-9191/16-014.
Der volle Inhalt der Quelle