Log in

Relevant bibliographies by topics / Computational Supremacy

Contents

Journal articles
Book chapters
Conference papers

Academic literature on the topic 'Computational Supremacy'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computational 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.

Journal articles on the topic "Computational Supremacy"

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

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

3

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

4

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

5

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

6

Sarpeshkar, Rahul, and Thomas E. Kurtz. "Quantum Computing: Redefining Computational Limits for the Next Era." International Journal of Innovative Computer Science and IT Research 1, no. 01 (2025): 1–6. https://doi.org/10.63665/ijicsitr.v1i01.02.

Full text

Abstract:

Quantum computing is poised to revolutionize the world of computation by har nessing the principles of quantum mechanics to solve problems that are beyond the capabilities of classical computers. Unlike traditional binary computing, which relies on bits that exist as 0s or 1s, quantum computing operates using qubits, which leverage superposition, entanglement, and quantum parallelism to perform computations exponentially faster. This transformative technology has applications in cryptography, artificial intelligence, materials science, and complex system simulations, offering unprecedented com

APA, Harvard, Vancouver, ISO, and other styles

7

Rahul, Sarpeshkar Thomas E. Kurtz. "Quantum Computing: Redefining Computational Limits for the Next Era." International Journal of Innovative Computer Science and IT Research 01, no. 01 (2025): 10–15. https://doi.org/10.5281/zenodo.15151970.

Full text

Abstract:

Quantum computing is poised to revolutionize the world of computation by harnessing the principles of quantum mechanics to solve problems that are beyond the capabilities of classical computers. Unlike traditional binary computing, which relies on bits that exist as 0s or 1s, quantum computing operates using qubits, which leverage superposition, entanglement, and quantum parallelism to perform computations exponentially faster. This transformative technology has applications in cryptography, artificial intelligence, materials science, and complex system simulations, of

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Bentivegna, Marco, Nicolò Spagnolo, Chiara Vitelli, et al. "Experimental scattershot boson sampling." Science Advances 1, no. 3 (2015): e1400255. http://dx.doi.org/10.1126/sciadv.1400255.

Full text

Abstract:

Boson sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialized quantum computer. Current experimental schemes, however, are still insufficient for a convincing demonstration of the advantage of quantum over classical computation. A new variation of this task, scattershot boson sampling, leads to an exponential increase in speed of the quantum device, using a larger number of photon sources based on parametric down-conversion. This is achieved by having multiple heralded single photons b

APA, Harvard, Vancouver, ISO, and other styles

10

Jain, Shilpa, Prakash C. Mathpal, Dinesh Bisht, and Phool Singh. "A Unique Computational Method for Constructing Intervals in Fuzzy Time Series Forecasting." Cybernetics and Information Technologies 18, no. 1 (2018): 3–10. http://dx.doi.org/10.2478/cait-2018-0001.

Full text

Abstract:

Abstract This research article suggests a computational method for constructing fuzzy sets in absence of expert knowledge. This method uses concepts of central tendencies mean and variance. This study gives a solution to the critical issue in designing of fuzzy systems, number of fuzzy sets. Proposed computational method helps in finding intervals and thereby fuzzy sets for fuzzy time series forecasting. Proposed computational method is implemented on the authentic data for the enrolments of University of Alabama, which is considered as benchmark problem in the field of fuzzy time series. The

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Computational Supremacy"

1

Calude, Cristian S., and Elena Calude. "The Road to Quantum Computational Supremacy." In Springer Proceedings in Mathematics & Statistics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-36568-4_22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Horner, Jack K., and John F. Symons. "What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated About Quantum Supremacy?" In Transactions on Computational Science and Computational Intelligence. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70873-3_29.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ivancova, Olga, Vladimir Korenkov, Nikita Ryabov, and Sergey Ulyanov. "Quantum Software Engineering: Quantum Gate-Based Computational Intelligence Supremacy." In Communications in Computer and Information Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64616-5_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Mei, Jingyi, Marcello Bonsangue, and Alfons Laarman. "Simulating Quantum Circuits by Model Counting." In Computer Aided Verification. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65633-0_25.

Full text

Abstract:

AbstractQuantum circuit compilation comprises many computationally hard reasoning tasks that lie inside #$${\textsf{P}}$$ P and its decision counterpart in $${\textsf{PP}}$$ PP . The classical simulation of universal quantum circuits is a core example. We show for the first time that a strong simulation of universal quantum circuits can be efficiently tackled through weighted model counting by providing a linear-length encoding of Clifford+T circuits. To achieve this, we exploit the stabilizer formalism by Knill, Gottesmann, and Aaronson by reinterpreting quantum states as a linear combination

APA, Harvard, Vancouver, ISO, and other styles

5

Rahman, Atta ur. "Applications of Hybrid Intelligent Systems in Adaptive Communication." In Advances in Computational Intelligence and Robotics. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2857-9.ch010.

Full text

Abstract:

Dynamic allocation of the resources for optimum utilization and throughput maximization is one of the most important fields of research nowadays. In this process the available resources are allocated in such a way that they are maximally utilized to enhance the overall system throughput. In this chapter a similar problem is approached which is found in Orthogonal Frequency Division Multiplexing (OFDM) environment, in which the transmission parameters namely the code rate, modulation scheme and power are adapted in such a way that overall system's data rate is maximized with a constrained bit e

APA, Harvard, Vancouver, ISO, and other styles

6

Tamilselvi, S. "Introduction to Evolutionary Algorithms." In Genetic Algorithms [Working Title]. IntechOpen, 2022. http://dx.doi.org/10.5772/intechopen.104198.

Full text

Abstract:

Real-world has many optimization scenarios with multiple constraints and objective functions that are discontinuous, nonlinear, non-convex, and multi-modal in nature. Also, the optimization problems are multi-dimensional with mixed types of variables like integer, real, discrete, binary, and having a different range of values which demands normalization. Hence, the search space of the problem cannot be smooth. Evolutionary algorithms have started gaining attention and have been employed for computational processes to solve complex engineering problems. Because it has become an instrument for r

APA, Harvard, Vancouver, ISO, and other styles

7

K., Sheela, and Priya C. "Information Retrieval in Business Industry Using Blockchain Technology and Artificial Intelligence." In Advances in Computational Intelligence and Robotics. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7728-8.ch011.

Full text

Abstract:

Industry 5.0 promotes automation in an optimized way. Collaboration with blockchain technology and artificial intelligence helps to enrich Industry 5.0 with its quantifiers and qualifiers. In the business industry, information plays an iconic role. When we consider the issues of storage and retrieval, we need to think about blockchain technology where the data will be stored and shared in a secure way. Here, the data will be distributed across the network in an encrypted format; hence, the original data can be viewed only by the owner of the data. Blockchain stores the information in the form

APA, Harvard, Vancouver, ISO, and other styles

8

Dey, Sandip, Siddhartha Bhattacharyya, and Ujjwal Maulik. "Quantum-Inspired Automatic Clustering Technique Using Ant Colony Optimization Algorithm." In Quantum-Inspired Intelligent Systems for Multimedia Data Analysis. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-5219-2.ch002.

Full text

Abstract:

Quantum computing has emerged as the most challenging field of research in efficient computation. This chapter introduces a novel quantum-inspired ant colony optimization technique for automatic clustering. This chapter presents an application of this proposed technique to the automatic clustering of real-life gray-scale image data sets. In contrary to the other techniques, the proposed one requires no previous knowledge of the data to be classified. It finds the optimal number of clusters of the data by itself. The Xie-Beni cluster validity measure has been employed as the objective function

APA, Harvard, Vancouver, ISO, and other styles

9

Marichelvam, Mariappan Kadarkarainadar, and Geetha M. "An Improved Monkey Search Algorithm to Solve the Flexible Job Shop Scheduling Problems With Makespan Objective." In Encyclopedia of Organizational Knowledge, Administration, and Technology. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-3473-1.ch053.

Full text

Abstract:

This work proposes a hybrid monkey search algorithm (HMSA) to solve the flexible job shop scheduling problem (FJSP) to minimize the makespan. The FJSP is a simple scheduling model that resembles numerous industrial production processes and the FJSP has been proved to be strongly NP-hard. Due to both theoretical and practical significance of FJSP, numerous researchers tackled the FJSP using different approaches. In this paper, the variable neighbourhood search (VNS) algorithm is combined with the monkey search algorithm (MSA) to enhance the solution quality. Benchmark problems are considered fo

APA, Harvard, Vancouver, ISO, and other styles

10

Muthusamy, Arvindhan. "Exploring Models, Training Methods, and Quantum Supremacy in Machine Learning and Quantum Computing." In Advances in Computer and Electrical Engineering. IGI Global, 2023. http://dx.doi.org/10.4018/978-1-6684-7535-5.ch002.

Full text

Abstract:

In this chapter, the authors will discuss some of the many models and training methods that have been developed in the field of machine learning to address this learning challenge. Models like neural networks and stochastic gradient descent have their own “go-to” training algorithms, each with their own set of supporting terminology and communities of experts. Since the specifics of gate decomposition, compilation, and error correction all depend heavily on the physical implementation of qubits and quantum gates, it has been difficult to design quantum hardware capable of running such algorith

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computational Supremacy"

1

Kish, Laszlo B. "Noise-based Logic versus Quantum Supremacy." In 2022 IEEE 22nd International Symposium on Computational Intelligence and Informatics and 8th IEEE International Conference on Recent Achievements in Mechatronics, Automation, Computer Science and Robotics (CINTI-MACRo). IEEE, 2022. http://dx.doi.org/10.1109/cinti-macro57952.2022.10029509.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Reich, Alton, David Carroll, Timothy Carlson, Miranda Reich, and Roberto Disalvo. "The Potential and Challenges of Quantum Computing for Engineering Applications." In ASME 2023 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/pvp2023-108275.

Full text

Abstract:

Abstract Quantum computing has generated splashy headlines with pronouncements of “quantum supremacy”, but the reality is much more complicated than simple headlines can capture. Quantum computers are designed to use the interactions between quantum objects, such as electron spins, to perform useful computations. This paper will provide an overview of some of the engineering challenges involved in developing quantum computers and highlight some potential applications of interest to the mechanical engineering community. These challenges include the need to isolate the quantum bits — the logic e

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Siyu, R. Ganesan, and T. S. Sankar. "A New Approach to Machinery Monitoring and Diagnostics Using Self-Organizing Maps." In ASME 1995 Design Engineering Technical Conferences collocated with the ASME 1995 15th International Computers in Engineering Conference and the ASME 1995 9th Annual Engineering Database Symposium. American Society of Mechanical Engineers, 1995. http://dx.doi.org/10.1115/detc1995-0533.

Full text

Abstract:

Abstract The problem of estimating an unknown multivariate function from on-line vibration measurements, for determining the conditions of a machine system and for estimating its service life is considered. This problem is formulated into a multiple-index based trend analysis problem and the corresponding indices for trend analysis are extracted from the on-line vibration data. Selection of these indices is based on the simultaneous consideration of commonly-observed faults or malfunctions in the machine system being monitored. A neural network algorithm that has been developed by the present

APA, Harvard, Vancouver, ISO, and other styles

4

Hadi, M. R., G. Mohammed, Ammar H. Shnawa, Myasar Mundher adnan, Mustafa Abdulsattar jebur, and Waleed Hameed. "Supremacy of Quantum Computation in Bioscience: A Technical Review." In 2023 6th International Conference on Engineering Technology and its Applications (IICETA). IEEE, 2023. http://dx.doi.org/10.1109/iiceta57613.2023.10351306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sun, Yajuan, Hai Lin, Fuchun Liu, and Ben M. Chen. "Computation for Supremal Simulation-Based Controllable Subautomata." In 2010 8th IEEE International Conference on Control and Automation (ICCA). IEEE, 2010. http://dx.doi.org/10.1109/icca.2010.5524261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zhang, Renyuan, and Kai Cai. "Online computation of supremal relatively observable sublanguage of discrete-event systems." In 2015 34th Chinese Control Conference (CCC). IEEE, 2015. http://dx.doi.org/10.1109/chicc.2015.7259985.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Alves, Marcos V. S., Lilian K. Carvalho, and Joao C. Basilio. "New algorithms for verification of relative observability and computation of supremal relatively observable sublanguage." In 2016 IEEE Conference on Control Applications (CCA). IEEE, 2016. http://dx.doi.org/10.1109/cca.2016.7587883.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Schmidt, Klaus, and Yiannis Boutalis. "Computation of supremal controllable sublanguages and infimal controllable superlanguages for fuzzy discrete event systems." In Automation (MED 2008). IEEE, 2008. http://dx.doi.org/10.1109/med.2008.4602002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Davydov, A., A. Larionov, and N. Nagul. "Logic inference based construction of a supervisor for a discrete event system." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments. Crossref, 2020. http://dx.doi.org/10.47350/iccs-de.2020.05.

Full text

Abstract:

The paper provides a general view on the original logical inference based approach to dealing with discrete event systems as subject to supervisory control theory. The approach proposes a representation of automata-based discrete event system as a positively constructed formula and implementation of the calculus of positively constructed formulas. The stages of a supervisor construction are illustrated with a simplified model of an autonomous underwater vehicle operational modes switching. The supremal controllable sublanguage of the specification and the supervisor are constructed.

APA, Harvard, Vancouver, ISO, and other styles

10

Davydov, A., A. Larionov, and N. Nagul. "The construction of controllable sublanguage of specification for DES via PCFs based inference." In The International Workshop on Information, Computation, and Control Systems for Distributed Environments. Crossref, 2020. http://dx.doi.org/10.47350/iccs-de.2020.06.

Full text

Abstract:

The paper considers how methods of a logical inference search in the calculus of positively constructed formulas may be applied to represent and study discrete event systems. The formalisms of discrete event systems and positively constructed formulas are briefly described. A method for constructing a product of automata using constructive inference in the positively constructed formulas calculus is proposed. Based on the given specication on the behaviour of the system, a method for constructing a supremal controllable sublanguage of the specication is presented.

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!