Log in

Relevant bibliographies by topics / Quantum supremacy / Journal articles

To see the other types of publications on this topic, follow the link: Quantum supremacy.

Journal articles on the topic 'Quantum supremacy'

Author: Grafiati

Published: 5 June 2025

Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quantum supremacy.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Harrow, Aram W., and Ashley Montanaro. "Quantum computational supremacy." Nature 549, no. 7671 (2017): 203–9. http://dx.doi.org/10.1038/nature23458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Debenedictis, Erik P. "Beyond Quantum Supremacy." Computer 53, no. 2 (2020): 91–94. http://dx.doi.org/10.1109/mc.2019.2958446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

DeBenedictis, Erik P. "Powerball and Quantum Supremacy." Computer 52, no. 10 (2019): 110–12. http://dx.doi.org/10.1109/mc.2019.2930166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Aron, Jacob. "Google plans quantum supremacy." New Scientist 231, no. 3089 (2016): 8–9. http://dx.doi.org/10.1016/s0262-4079(16)31583-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

B, Michael, and Nature m. "Before the Quantum Supremacy." Scientific American 30, no. 5s (2021): None. http://dx.doi.org/10.1038/scientificamericanspace1219-20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kretschmer, William. "The Quantum Supremacy Tsirelson Inequality." Quantum 5 (October 7, 2021): 560. http://dx.doi.org/10.22331/q-2021-10-07-560.

Full text

Abstract:

A leading proposal for verifying near-term quantum supremacy experiments on noisy random quantum circuits is linear cross-entropy benchmarking. For a quantum circuit C on n qubits and a sample z∈{0,1}n, the benchmark involves computing |⟨z|C|0n⟩|2, i.e. the probability of measuring z from the output distribution of C on the all zeros input. Under a strong conjecture about the classical hardness of estimating output probabilities of quantum circuits, no polynomial-time classical algorithm given C can output a string z such that |⟨z|C|0n⟩|2 is substantially larger than 12n (Aaronson and Gunn, 20

APA, Harvard, Vancouver, ISO, and other styles

7

Morimae, Tomoyuki, and Suguru Tamaki. "Fine-grained quantum computational supremacy." quantum Information and Computation 19, no. 13&14 (2019): 1089–115. http://dx.doi.org/10.26421/qic19.13-14-2.

Full text

Abstract:

(pp1089-1115) Tomoyuki Morimae and Suguru Tamaki doi: https://doi.org/10.26421/QIC19.13-14-2 Abstracts: Output probability distributions of several sub-universal quantum computing models cannot be classically efficiently sampled unless some unlikely consequences occur in classical complexity theory, such as the collapse of the polynomial-time hierarchy. These results, so called quantum supremacy, however, do not rule out possibilities of super-polynomial-time classical simulations. In this paper, we study ``fine-grained" version of quantum supremacy that excludes some exponential-time classica

APA, Harvard, Vancouver, ISO, and other styles

8

Kocharovsky, Vitaly. "Universal nature of quantum supremacy." Journal of Physics: Conference Series 2894, no. 1 (2024): 012002. http://dx.doi.org/10.1088/1742-6596/2894/1/012002.

Full text

Abstract:

Abstract We disclose the universal nature of computational #P-hardness and quantum supremacy of quantum many-body systems. We do so by means of the new powerful technique (the hafnian master theorem) that allows one to address the #P-hard problems systematically. We consider a generic example of many-body interacting systems – a trapped BEC-gas of interacting Bose atoms, apply the hafnian master theorem and refer to the Toda’s theorem on a #P-complete oracle.

APA, Harvard, Vancouver, ISO, and other styles

9

Terhal, Barbara M. "Quantum supremacy, here we come." Nature Physics 14, no. 6 (2018): 530–31. http://dx.doi.org/10.1038/s41567-018-0131-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yung, Man-Hong. "Quantum supremacy: some fundamental concepts." National Science Review 6, no. 1 (2018): 22–23. http://dx.doi.org/10.1093/nsr/nwy072.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

S, Neil. "Quantum Computers Compete for "Supremacy"." Scientific American 27, no. 3s (2018): 108. http://dx.doi.org/10.1038/scientificamericantimerevolution0718-108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

O.D., Primqulov. "THE PURSUIT OF QUANTUM SUPREMACY: CHALLENGES AND IMPLICATIONS." Innovative Development in Educational Activities 2, no. 7 (2023): 200–205. https://doi.org/10.5281/zenodo.7823879.

Full text

Abstract:

<em>This article discusses the concept of quantum supremacy and the challenges associated with achieving it. It explains the fundamental principles of quantum computing, such as superposition and entanglement, and how they can be harnessed to perform calculations at a speed that is impossible with classical computers. The article explores the challenges associated with achieving quantum supremacy, such as noise and error correction, scaling, and hardware and software development.</em> <em>The article also discusses the implications of achieving quantum supremacy in various fields, such as cryp

APA, Harvard, Vancouver, ISO, and other styles

13

Maksudul Shadat Akash and Shamsia Afrin Jamema. "Quantum supremacy and its implications for classical computing." World Journal of Advanced Engineering Technology and Sciences 14, no. 2 (2025): 036–41. https://doi.org/10.30574/wjaets.2025.14.2.0032.

Full text

Abstract:

Quantum computing, leveraging the principles of superposition and entanglement, has emerged as a revolutionary technology with the potential to outperform classical computers in specific tasks. This paper explores the concept of quantum supremacy, marked by Google's Sycamore processor, and its implications for classical computing. It discusses the foundations of quantum computing, including qubits, superposition, and key quantum algorithms like Shor's and Grover's, highlighting their advantages over classical systems. This study addresses the milestones in achieving quantum supremacy, includin

APA, Harvard, Vancouver, ISO, and other styles

14

Gottesman, Daniel, and Hoi-Kwong Lo. "From quantum cheating to quantum security." Physics Today 78, no. 1 (2025): 47–53. https://doi.org/10.1063/pt.lrtg.ryvs.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Morimae, Tomoyuki, and Suguru Tamaki. "Additive-error fine-grained quantum supremacy." Quantum 4 (September 24, 2020): 329. http://dx.doi.org/10.22331/q-2020-09-24-329.

Full text

Abstract:

It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in classical complexity theory. Recently, these results have been improved to ``fine-grained" versions where even exponential-time classical simulations are excluded assuming certain classical fine-grained complexity conjectures. All these fine-grained results are, however, about the hardness of strong simulations or multiplicative-error sampling. It

APA, Harvard, Vancouver, ISO, and other styles

16

Zhang, Han. "Quantum Entanglement and Qubit Interactions: The Key to Quantum Supremacy." Theoretical and Natural Science 41, no. 1 (2024): 115–21. http://dx.doi.org/10.54254/2753-8818/41/2024ch0156.

Full text

Abstract:

Abstract. Quantum computing operates in a fundamentally different way from classical computing by harnessing the principles of quantum mechanics to process information. Quantum supremacy is achieved when a quantum computer can solve problems that are beyond the capabilities of classical systems, including the human brain, showcasing its superior processing power. To attain quantum supremacy, quantum entanglement and qubit interactions play a pivotal role. Quantum entanglement occurs when qubits are interconnected in a manner where the state of one qubit directly influences the state of others,

APA, Harvard, Vancouver, ISO, and other styles

17

Kim, Mark. "Quantum supremacy feat just got harder." New Scientist 236, no. 3149 (2017): 12. http://dx.doi.org/10.1016/s0262-4079(17)32102-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Palacios-Berraquero, Carmen, Leonie Mueck, and Divya M. Persaud. "Instead of ‘supremacy’ use ‘quantum advantage’." Nature 576, no. 7786 (2019): 213. http://dx.doi.org/10.1038/d41586-019-03781-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Brooks, Michael. "Beyond quantum supremacy: the hunt for useful quantum computers." Nature 574, no. 7776 (2019): 19–21. http://dx.doi.org/10.1038/d41586-019-02936-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Gibney, Elizabeth. "Hello quantum world! Google publishes landmark quantum supremacy claim." Nature 574, no. 7779 (2019): 461–62. http://dx.doi.org/10.1038/d41586-019-03213-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Cho, Adrian. "Ordinary computer matches Google’s quantum computer." Science 377, no. 6606 (2022): 563–64. http://dx.doi.org/10.1126/science.ade2360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Khrennikov, Andrei. "Roots of quantum computing supremacy: superposition, entanglement, or complementarity?" European Physical Journal Special Topics 230, no. 4 (2021): 1053–57. http://dx.doi.org/10.1140/epjs/s11734-021-00061-9.

Full text

Abstract:

AbstractThe recent claim of Google to have brought forth a breakthrough in quantum computing represents a major impetus to further analyze the foundations for any claims of superiority regarding quantum algorithms. This note attempts to present a conceptual step in this direction. I start with a critical analysis of what is commonly referred to as entanglement and quantum nonlocality and whether or not these concepts may be the basis of quantum superiority. Bell-type experiments are then interpreted as statistical tests of Bohr’s principle of complementarity (PCOM), which is, thus, given a foo

APA, Harvard, Vancouver, ISO, and other styles

23

Boixo, Sergio, Sergei V. Isakov, Vadim N. Smelyanskiy, et al. "Characterizing quantum supremacy in near-term devices." Nature Physics 14, no. 6 (2018): 595–600. http://dx.doi.org/10.1038/s41567-018-0124-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Courtland, Rachel. "Google aims for quantum computing supremacy [News]." IEEE Spectrum 54, no. 6 (2017): 9–10. http://dx.doi.org/10.1109/mspec.2017.7934217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Jaramillo, J., M. Beau, and A. del Campo. "Quantum supremacy of many-particle thermal machines." New Journal of Physics 18, no. 7 (2016): 075019. http://dx.doi.org/10.1088/1367-2630/18/7/075019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Arute, Frank, Kunal Arya, Ryan Babbush, et al. "Quantum supremacy using a programmable superconducting processor." Nature 574, no. 7779 (2019): 505–10. http://dx.doi.org/10.1038/s41586-019-1666-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Crane, Leah. "Quantum computer that measures light achieves supremacy." New Scientist 248, no. 3312 (2020): 18. http://dx.doi.org/10.1016/s0262-4079(20)32159-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Li, Riling, Bujiao Wu, Mingsheng Ying, Xiaoming Sun, and Guangwen Yang. "Quantum Supremacy Circuit Simulation on Sunway TaihuLight." IEEE Transactions on Parallel and Distributed Systems 31, no. 4 (2020): 805–16. http://dx.doi.org/10.1109/tpds.2019.2947511.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Bremner, Michael J., Ashley Montanaro, and Dan J. Shepherd. "Achieving quantum supremacy with sparse and noisy commuting quantum computations." Quantum 1 (April 25, 2017): 8. http://dx.doi.org/10.22331/q-2017-04-25-8.

Full text

Abstract:

The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n qubits in depth O(sqrt(n) log n), and which is likely hard to simulate classically. Next, we show that, if an arbitrarily small constant amount of noise is applied to each qubit at the end of any IQP ci

APA, Harvard, Vancouver, ISO, and other styles

30

Kapourniotis, Theodoros, and Animesh Datta. "Nonadaptive fault-tolerant verification of quantum supremacy with noise." Quantum 3 (July 12, 2019): 164. http://dx.doi.org/10.22331/q-2019-07-12-164.

Full text

Abstract:

Quantum samplers are believed capable of sampling efficiently from distributions that are classically hard to sample from. We consider a sampler inspired by the classical Ising model. It is nonadaptive and therefore experimentally amenable. Under a plausible conjecture, classical sampling upto additive errors from this model is known to be hard. We present a trap-based verification scheme for quantum supremacy that only requires the verifier to prepare single-qubit states. The verification is done on the same model as the original sampler, a square lattice, with only a constant overhead. We ne

APA, Harvard, Vancouver, ISO, and other styles

31

Dalzell, Alexander M., Aram W. Harrow, Dax Enshan Koh, and Rolando L. La Placa. "How many qubits are needed for quantum computational supremacy?" Quantum 4 (May 11, 2020): 264. http://dx.doi.org/10.22331/q-2020-05-11-264.

Full text

Abstract:

Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of classical computation. One common assumption is that the polynomial hierarchy (PH) does not collapse, a stronger version of the statement that P≠NP, which leads to the conclusion that any classical simulation of certain families of quantum circuits requires time scaling worse than any polynomial in the size of the circuits. However, the asymptotic nature of

APA, Harvard, Vancouver, ISO, and other styles

32

Latmiral, Ludovico, Nicolò Spagnolo, and Fabio Sciarrino. "Towards quantum supremacy with lossy scattershot boson sampling." New Journal of Physics 18, no. 11 (2016): 113008. http://dx.doi.org/10.1088/1367-2630/18/11/113008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Sokolova, Marianna E. "INFORMATION TECHNO MIRAGES OF QUANTUM COMPUTERS." Век информации (сетевое издание) 5, no. 4 (2021): 16–30. http://dx.doi.org/10.33941/age-info.com54(17)2.

Full text

Abstract:

The article is devoted to the trends in the formation of the information space of quantum technologies. As an example, the information construction of the results of an experiment to achieve quantum supremacy at Google and discussions about this in the American IT community are considered.

APA, Harvard, Vancouver, ISO, and other styles

34

Morimae, Tomoyuki. "Secure Cloud Quantum Computing with Verification Based on Quantum Interactive Proof." Impact 2019, no. 10 (2019): 30–32. http://dx.doi.org/10.21820/23987073.2019.10.30.

Full text

Abstract:

In cloud quantum computing, a classical client delegate quantum computing to a remote quantum server. An important property of cloud quantum computing is the verifiability: the client can check the integrity of the server. Whether such a classical verification of quantum computing is possible or not is one of the most important open problems in quantum computing. We tackle this problem from the view point of quantum interactive proof systems. Dr Tomoyuki Morimae is part of the Quantum Information Group at the Yukawa Institute for Theoretical Physics at Kyoto University, Japan. He leads a team

APA, Harvard, Vancouver, ISO, and other styles

35

Atiya, Abdulkader H., and Mohammed Al-Temimi. "Review of Recent Laser Technology of Development Multi Qubit Gates Using Ion Trap Method." Applied Mechanics and Materials 915 (August 18, 2023): 33–42. http://dx.doi.org/10.4028/p-j6vsf9.

Full text

Abstract:

The qubit technology using Trapped ions are taking the systems for practical quantum computing (QC). The normal requirements to achieve quantum supremacy have all been studied with ions, and quantum algorithms use ion-qubit systems have been implemented. I cover in this study many points regarding the concept of Qubit through Ion Trap, near application, and experiments also explore the Multi gates, Hybrid gates implementations

APA, Harvard, Vancouver, ISO, and other styles

36

Ahmed, Amjed, and Mohammad Hasan. "Exploring Quantum Computing: Potential Applications and Current Challenges in Algorithm Design." CyberSystem Journal 1, no. 1 (2024): 42–53. http://dx.doi.org/10.57238/4srf6b63.

Full text

Abstract:

Quantum supremacy refers to the experimental demonstration that a quantum computing device performs a calculation that no classical computer can match in a reasonable time. Such machines would not be useful for solving problems of practical interest, but they would provide a proof of principle that larger and more useful machines could be built. The gap between classical and quantum computing is potentially enormous, and the apparent ease with which quantum states can be prepared, manipulated, and measured has led many to believe that quantum devices might one day outperform classical hardware

APA, Harvard, Vancouver, ISO, and other styles

37

Patel, Prachi. "Nanosys CEO Jason Hartlove's Quest for Quantum Dot Supremacy." Information Display 38, no. 5 (2022): 26–29. http://dx.doi.org/10.1002/msid.1336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Neill, C., P. Roushan, K. Kechedzhi, et al. "A blueprint for demonstrating quantum supremacy with superconducting qubits." Science 360, no. 6385 (2018): 195–99. http://dx.doi.org/10.1126/science.aao4309.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

БЕТЕРОВ, И. И. "PROGRESS AND PROSPECTS IN THE FIELD OF QUANTUM COMPUTING." Автометрия 60, no. 1 (2024): 38–48. http://dx.doi.org/10.15372/aut20240104.

Full text

Abstract:

В статье представлен краткий обзор современных достижений в квантовой информатике, проблем и перспектив развития квантовых вычислений. Обсуждаются элементарная математическая модель квантовых вычислений и понятие квантового превосходства. Рассматривается применение ультрахолодных атомов для реализации квантовых процессоров. The article provides a brief overview of modern achievements in quantum information science, problems and prospects for the development of quantum computing. The elementary mathematical model of quantum computing and the concept of quantum supremacy are discussed. The use o

APA, Harvard, Vancouver, ISO, and other styles

40

Mittal, Meera. "Quantum Computing and Information: Recent Developments and Future Prospects." Journal of Quantum Science and Technology 1, no. 2 (2024): 12–17. http://dx.doi.org/10.36676/jqst.v1.i2.10.

Full text

Abstract:

Recent advancements in quantum computing have sparked significant interest due to their potential to revolutionize various fields, from cryptography to optimization problems. This paper reviews recent developments in quantum computing and quantum information theory, focusing on breakthroughs in qubit stability, error correction codes, and quantum algorithm design. Key achievements include the demonstration of quantum supremacy in specific tasks and progress towards scalable quantum processors. Looking forward, the prospects of quantum computing in solving complex computational problems and its

APA, Harvard, Vancouver, ISO, and other styles

41

Padamwar, Badri Vishal, and P. Hema Rao. "Quantum Computing Mathematical Foundations and Practical Implications." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 11, no. 3 (2020): 2911–15. http://dx.doi.org/10.61841/turcomat.v11i3.14659.

Full text

Abstract:

Quantum computing is a rapidly advancing field with the potential to revolutionize computation. This paper provides an overview of quantum computing, emphasizing its mathematical foundations and practical implications. We discuss key concepts from quantum mechanics that form the basis of quantum computing, such as superposition and entanglement, and explore quantum algorithms like Shor's algorithm and Grover's algorithm. The paper also examines the practical implications of quantum computing in cryptography, optimization, and machine learning, highlighting quantum key distribution, quantum ann

APA, Harvard, Vancouver, ISO, and other styles

42

Chabaud, Ulysse, Frédéric Grosshans, Elham Kashefi, and Damian Markham. "Efficient verification of Boson Sampling." Quantum 5 (November 15, 2021): 578. http://dx.doi.org/10.22331/q-2021-11-15-578.

Full text

Abstract:

The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing. While quantum speedup experiments are gradually escaping the regime of classical simulation, they still lack efficient verification protocols and rely on partial validation. Here we derive an efficient protocol for verifying with single-mode Gaussian measurements the output states of a large class of continuous-variable quantum circuits demonstrating qua

APA, Harvard, Vancouver, ISO, and other styles

43

der Kerk, Casper van, Attila Csala, and Aeilko H. Zwinderman. "Quantum Computing in the Biomedical Sciences; A Brief Introduction into Concepts and Applications." Computer and Information Science 12, no. 3 (2019): 104. http://dx.doi.org/10.5539/cis.v12n3p104.

Full text

Abstract:

Quantum computing is a field that aims to exploit the principles of superposition and entanglement to perform computations. By using quantum bits (qubits) a quantum computer is able to perform certain tasks more efficiently when compared to classical computers. While applied quantum computing is still in its early stages, quantum algorithms on simulated quantum computers have already been applied to certain problems in epidemics modeling and image processing. Furthermore, companies like Google and IBM continue to develop new quantum computers with an increasing number of qubits. While much pro

APA, Harvard, Vancouver, ISO, and other styles

44

Vincent, Trevor, Lee J. O'Riordan, Mikhail Andrenkov, et al. "Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction." Quantum 6 (May 9, 2022): 709. http://dx.doi.org/10.22331/q-2022-05-09-709.

Full text

Abstract:

We introduce a new open-source software library Jet, which uses task-based parallelism to obtain speed-ups in classical tensor-network simulations of quantum circuits. These speed-ups result from i) the increased parallelism introduced by mapping the tensor-network simulation to a task-based framework, ii) a novel method of reusing shared work between tensor-network contraction tasks, and iii) the concurrent contraction of tensor networks on all available hardware. We demonstrate the advantages of our method by benchmarking our code on several Sycamore-53 and Gaussian boson sampling (GBS) supr

APA, Harvard, Vancouver, ISO, and other styles

45

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. Pt. I:Quantum software engineering–quantum gate level applied models simulators." System Analysis in Science and Education, no. 1 (2020) (2020): 52–84. http://dx.doi.org/10.37005/2071-9612-2020-1-52-84.

Full text

Abstract:

Principles and methodologies of quantum algorithmic gates design for master course and PhD students in computer science, control engineering and intelligent robotics described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. Applications of quantum gate of nanotechnology in intelligent quantum control introduced. Anew approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. The main attention focused on the development of design method of fast quantum algorithm operators as superpos

APA, Harvard, Vancouver, ISO, and other styles

46

Singh, Pritpal, Gaurav Dhiman, Sen Guo, et al. "A hybrid fuzzy quantum time series and linear programming model: Special application on TAIEX index dataset." Modern Physics Letters A 34, no. 25 (2019): 1950201. http://dx.doi.org/10.1142/s0217732319502018.

Full text

Abstract:

The supremacy of quantum approach is able to provide the solutions which are not practically feasible on classical machines. This paper introduces a novel quantum model for time series data which depends on the appropriate length of intervals. In this study, the effects of these drawbacks are elaborately illustrated, and some significant measures to remove them are suggested, such as use of degree of membership along with mid-value of the interval. All these improvements signify the effective results in case of quantum time series, which are verified and validated with real-time datasets.

APA, Harvard, Vancouver, ISO, and other styles

47

Ivancova, Olga, Vladimir Korenkov, Olga Tyatyushkina, Sergey Ulyanov, and Toshio Fukuda. "Quantum supremacy in end-to-end intelligent IT. PT. III. Quantum software engineering – quantum approximate optimization algorithm on small quantum processors." System Analysis in Science and Education, no. 2 (2020) (June 30, 2020): 115–76. http://dx.doi.org/10.37005/2071-9612-2020-2-115-176.

Full text

Abstract:

Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal

APA, Harvard, Vancouver, ISO, and other styles

48

Villalonga, Benjamin, Dmitry Lyakh, Sergio Boixo, et al. "Establishing the quantum supremacy frontier with a 281 Pflop/s simulation." Quantum Science and Technology 5, no. 3 (2020): 034003. http://dx.doi.org/10.1088/2058-9565/ab7eeb.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Urgelles, Helen, Pablo Picazo-Martinez, David Garcia-Roger, and Jose F. Monserrat. "Multi-Objective Routing Optimization for 6G Communication Networks Using a Quantum Approximate Optimization Algorithm." Sensors 22, no. 19 (2022): 7570. http://dx.doi.org/10.3390/s22197570.

Full text

Abstract:

Sixth-generation wireless (6G) technology has been focused on in the wireless research community. Global coverage, massive spectrum usage, complex new applications, and strong security are among the new paradigms introduced by 6G. However, realizing such features may require computation capabilities transcending those of present (classical) computers. Large technology companies are already exploring quantum computers, which could be adopted as potential technological enablers for 6G. This is a promising avenue to explore because quantum computers exploit the properties of quantum states to per

APA, Harvard, Vancouver, ISO, and other styles

50

Tamrakar, Abha, and Rishabh Sharma. "Quantum Computing: A Comprehensive Review." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 10, no. 3 (2019): 1634–42. http://dx.doi.org/10.61841/turcomat.v10i3.14623.

Full text

Abstract:

Quantum computing has emerged as a revolutionary paradigm that promises to solve computational problems beyond the capabilities of classical computers. This comprehensive review paper explores the fundamentals, models, algorithms, technologies, challenges, and practical applications of quantum computing. The paper begins with an introduction to quantum computing, highlighting its defining features and significance. It then discusses the fundamentals of quantum computing, including qubits, quantum gates, quantum entanglement, and quantum parallelism. The paper also examines different quantum co

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!