-
The variational quantum eigensolver (or VQE), first developed by Peruzzo et al. (2014), has received significant attention from the research community in recent years. It uses the variational principle to compute the ground state energy of a Hamiltonian, a pro…
openalex
Jules Tilly, Hongxiang Chen, Shuxiang Cao, Dario Picozzi 等
2022-09-23
置信度 0.72
Quantum computerWave functionQuantumHamiltonian (control theory)Physics
-
Generative adversarial networks represent a powerful tool for classical machine learning: a generator tries to create statistics for data that mimics those of a true data set, while a discriminator tries to discriminate between the true and fake data. The lear…
openalex
Seth Lloyd, Christian Weedbrook
2018-07-26
置信度 0.72
DiscriminatorGenerator (circuit theory)Computer scienceQuantumGenerative grammar
-
While the emergent field of quantum thermodynamics has the potential to impact energy science, the performance of thermal machines is often classical. We ask whether quantum effects can boost the performance of a thermal machine to reach quantum supremacy, i.e…
arxiv
Juan Jaramillo, Mathieu Beau, Adolfo del Campo
2015-10-15T17:12:19Z
置信度 0.78
quant-phcond-mat.quant-gas
-
In October 2019, Nature published a paper describing an experiment that took place at Google. The paper claims to demonstrate quantum (computational) supremacy on a 53-qubit quantum computer. Since September 2019 we have been involved in a long-term project to…
arxiv
Gil Kalai, Yosef Rinott, Tomer Shoham
2022-10-23T15:36:25Z
置信度 0.78
quant-phcs.CC
-
A crucial milestone in the field of quantum simulation and computation is to demonstrate that a quantum device can compute certain tasks that are impossible to reproduce by a classical computer with any reasonable resources. Such a demonstration is referred to…
arxiv
Jirawat Tangpanitanon, Supanut Thanasilp, Marc-Antoine Lemonde, Ninnat Dangiam 等
2020-02-27T07:20:15Z
置信度 0.78
quant-phcond-mat.stat-mechcond-mat.str-el
-
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 re…
arxiv
Tomoyuki Morimae, Suguru Tamaki
2019-01-07T01:23:56Z
置信度 0.78
quant-phcs.CC
-
We present an idiosyncratic view of the race for quantum computational supremacy. Google's approach and IBM challenge are examined. An unexpected side-effect of the race is the significant progress in designing fast classical algorithms. Quantum supremacy, if …
arxiv
Cristian S. Calude, Elena Calude
2017-12-04T20:57:59Z
置信度 0.78
quant-ph
-
It is predicted that quantum computers will dramatically outperform their conventional counterparts. However, large-scale universal quantum computers are yet to be built. Boson sampling is a rudimentary quantum algorithm tailored to the platform of photons in …
arxiv
Alex Neville, Chris Sparrow, Raphaël Clifford, Eric Johnston 等
2017-05-01T19:52:02Z
置信度 0.78
quant-ph
-
Without a complete theory of quantum gravity, the question of how quantum fields and quantum particles behave in a superposition of spacetimes seems beyond the reach of theoretical and experimental investigations. Here we use an extension of the quantum refere…
arxiv
Viktoria Kabel, Anne-Catherine de la Hamette, Esteban Castro-Ruiz, Časlav Brukner
2022-06-30T18:00:02Z
置信度 0.78
quant-phgr-qchep-th
-
The main focus of this thesis is to study the nonclassical and phase properties of a family of engineered quantum states, most of which show various nonclassical features. The beauty of these states is that these states can be used to establish quantum suprema…
arxiv
Priya Malpani
2020-11-19T12:01:11Z
置信度 0.78
quant-ph
-
The formalism of quantum theory over discrete systems is extended in two significant ways. First, quantum evolutions are generalized to act over entire network configurations, so that nodes may find themselves in a quantum superposition of being connected or n…
arxiv
Pablo Arrighi, Amélia Durbec, Matt Wilson
2021-10-20T14:29:47Z
置信度 0.78
quant-phcs.ETgr-qcmath-phmath.DS
-
Naive attempts to put together relativity and quantum measurements lead to signaling between space-like separated regions. In QFT, these are known as impossible measurements. We show that the same problem arises in non-relativistic quantum physics, where joint…
arxiv
Nicolas Gisin, Flavio Del Santo
2023-11-22T19:00:16Z
置信度 0.78
quant-phgr-qchep-th
-
We discuss monitoring the time evolution of an analog quantum simulator via a quantum non-demolition (QND) coupling to an auxiliary `clock' qubit. The QND variable of interest is the `energy' of the quantum many-body system, represented by the Hamiltonian of t…
arxiv
Denis V. Vasilyev, Andrey Grankin, Mikhail A. Baranov, Lukas M. Sieberer 等
2020-05-30T08:02:12Z
置信度 0.78
quant-phcond-mat.dis-nncond-mat.quant-gas
-
We review a recently introduced unified approach to the analytical quantification of correlations in Gaussian states of bosonic scalar fields by means of Renyi-2 entropy. This allows us to obtain handy formulae for classical, quantum, total correlations, as we…
arxiv
Gerardo Adesso, Sammy Ragy, Davide Girolami
2012-05-01T17:27:22Z
置信度 0.78
quant-phgr-qchep-thmath-ph
-
We analyze the efficiency of protocols for adiabatic quantum state transfer assisted by an engineered reservoir. The target dynamics is a quantum trajectory in the Hilbert space and is a fixed point of a time-dependent master equation in the limit of adiabatic…
arxiv
Emma C. King, Luigi Giannelli, Raphaël Menu, Johannes N. Kriel 等
2023-11-20T17:21:36Z
置信度 0.78
quant-phcond-mat.quant-gas
-
In general relativity, the description of spacetime relies on idealised rods and clocks, which identify a reference frame. In any concrete scenario, reference frames are associated to physical systems, which are ultimately quantum in nature. A relativistic des…
arxiv
Flaminia Giacomini
2021-01-27T19:00:04Z
置信度 0.78
quant-phgr-qc
-
Recently, it was shown that when reference frames are associated to quantum systems, the transformation laws between such quantum reference frames need to be modified to take into account the quantum and dynamical features of the reference frames. This led to …
arxiv
Angel Ballesteros, Flaminia Giacomini, Giulia Gubitosi
2020-12-31T17:42:13Z
置信度 0.78
quant-phgr-qchep-thmath-ph
-
The problem of objectivity, i.e. how to explain on quantum grounds the objective character of the macroscopic world, is one of the aspects of the celebrated quantum-to-classical transition. Initiated by W. H. Zurek and collaborators, this problem gained some a…
arxiv
J. K. Korbicz
2020-07-08T17:22:02Z
置信度 0.78
quant-ph
-
Quantum simulation promises to have wide applications in many fields where problems are hard to model with classical computers. Various quantum devices of different platforms have been built to tackle the problems in, say, quantum chemistry, condensed matter p…
arxiv
Keren Li, Muxin Han, Dongxue Qu, Zichang Huang 等
2017-04-30T19:22:29Z
置信度 0.78
quant-phcond-mat.str-elgr-qchep-th
-
Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking tree search augmente…
arxiv
Kyle E. C. Booth, Bryan O'Gorman, Jeffrey Marshall, Stuart Hadfield 等
2021-03-08T01:29:53Z
置信度 0.78
quant-phcs.DS
-
Observed quantum correlations are known to determine in certain cases the underlying quantum state and measurements. This phenomenon is known as (quantum) self-testing. Self-testing constitutes a significant research area with practical and theoretical ramific…
arxiv
Matthias Christandl, Nicholas Gauguin Houghton-Larsen, Laura Mancinska
2021-08-13T14:06:52Z
置信度 0.78
quant-ph
-
In a quantum world, reference frames are ultimately quantum systems too -- but what does it mean to "jump into the perspective of a quantum particle"? In this work, we show that quantum reference frame (QRF) transformations appear naturally as symmetries of si…
arxiv
Marius Krumm, Philipp A. Hoehn, Markus P. Mueller
2020-11-03T19:00:14Z
置信度 0.78
quant-phgr-qcmath-ph
-
Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a resource called shared ra…
arxiv
Tamal Guha, Mir Alimuddin, Sumit Rout, Amit Mukherjee 等
2020-01-07T05:02:51Z
置信度 0.78
quant-ph
-
Quantum state designs, by enabling an efficient sampling of random quantum states, play a quintessential role in devising and benchmarking various quantum protocols with broad applications ranging from circuit designs to black hole physics. Symmetries, on the …
arxiv
Naga Dileep Varikuti, Soumik Bandyopadhyay
2024-02-14T05:35:03Z
置信度 0.78
quant-phcond-mat.quant-gascond-mat.stat-mechcond-mat.str-elhep-th
-
Quantum technologies are currently the object of high expectations from governments and private companies, as they hold the promise to shape safer and faster ways to extract, exchange and treat information. However, despite its major potential impact for indus…
arxiv
A. Auffèves
2021-11-17T17:17:26Z
置信度 0.78
quant-ph
-
Quantum supremacy has been explored extensively in gate-model settings. Here, we introduce a quantum-supremacy framework for a hybrid digital-analog-digital quantum computing (DADQC) model. We consider a device that applies an initial layer of single-qubit gat…
arxiv
Daniel Lidar
2025-12-08T03:23:36Z
置信度 0.78
quant-ph
-
The effective quantum field theory description of gravity, despite its non-renormalizability, allows for predictions beyond classical general relativity. As we enter the age of gravitational wave astronomy, an important and timely question is whether measurabl…
arxiv
Thiago Guerreiro, Francesco Coradeschi, Antonia Micol Frassino, Jennifer Rittenhouse West 等
2021-11-02T17:55:53Z
置信度 0.78
gr-qchep-phquant-ph
-
We demonstrate characterizing quantum evolutions via matrix factorization algorithm, a particular type of the recommender system (RS). A system undergoing a quantum evolution can be characterized in several ways. Here we choose (i) quantum correlations quantif…
arxiv
Priya Batra, Anukriti Singh, T. S. Mahesh
2020-05-21T10:28:10Z
置信度 0.78
quant-ph
-
Quantum phase estimation is one of the critical building blocks of quantum computing. For early fault-tolerant quantum devices, it is desirable for a quantum phase estimation algorithm to (1) use a minimal number of ancilla qubits, (2) allow for inexact initia…
arxiv
Hongkang Ni, Haoya Li, Lexing Ying
2023-02-05T18:40:49Z
置信度 0.78
quant-ph
-
The quest for quantum advantage, wherein quantum computers surpass the computational capabilities of classical computers executing state-of-the-art algorithms on well-defined tasks, represents a pivotal race in the domain of quantum computing. NISQ (Noisy Inte…
arxiv
Muhammad AbuGhanem, Hichem Eleuch
2023-09-29T09:35:15Z
置信度 0.78
quant-phcs.AR
-
Utilizing quantum computer to investigate quantum chemistry is an important research field nowadays. In addition to the ground-state problems that have been widely studied, the determination of excited-states plays a crucial role in the prediction and modeling…
arxiv
Jingwei Wen, Zhengan Wang, Chitong Chen, Junxiang Xiao 等
2021-12-28T15:48:09Z
置信度 0.78
quant-ph
-
Operational quantum stochastic thermodynamics is a recently proposed theory to study the thermodynamics of open systems based on the rigorous notion of a quantum stochastic process or quantum causal model. In there, a stochastic trajectory is defined solely in…
arxiv
Philipp Strasberg
2019-11-05T11:45:23Z
置信度 0.78
quant-phcond-mat.stat-mech
-
Topological quantum computing is a way of allowing precise quantum computations to run on noisy and imperfect hardware. One implementation uses surface codes created by forming defects in a highly-entangled cluster state. Such a method of computing is a leadin…
arxiv
Dominic Horsman
2011-01-25T05:17:44Z
置信度 0.78
quant-ph
-
The quantum switch, a process enabling a coherent superposition of different orders of quantum channels, has garnered significant attention due to its ability to enable noiseless communications through noisy channels, such as entanglement-breaking channels. Ho…
arxiv
Claudio Pellitteri, Marcello Caleffi, Angela Sara Cacciapuoti
2025-08-25T14:43:29Z
置信度 0.78
quant-phcs.NI
-
The advent of quantum algorithms has initiated a discourse on the potential for quantum speedups for optimization problems. However, several factors still hinder a practical realization of the potential benefits. These include the lack of advanced, error-free …
arxiv
Domenik Eichhorn, Maximilian Schweikart, Nick Poser, Frederik Fiand 等
2024-05-15T06:19:39Z
置信度 0.78
quant-phcs.SE
-
This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been successfully applied to a varie…
arxiv
Royal Skousen
2000-08-25T16:46:18Z
置信度 0.78
quant-ph
-
We present a methodology to price options and portfolios of options on a gate-based quantum computer using amplitude estimation, an algorithm which provides a quadratic speedup compared to classical Monte Carlo methods. The options that we cover include vanill…
arxiv
Nikitas Stamatopoulos, Daniel J. Egger, Yue Sun, Christa Zoufal 等
2019-05-07T16:14:09Z
置信度 0.78
quant-ph
-
In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases of matter, called any…
arxiv
Torsten Asselmeyer-Maluga
2021-07-16T12:53:08Z
置信度 0.78
quant-phphysics.app-ph
-
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
arxiv
M. B. Hastings
2020-05-07T22:37:53Z
置信度 0.78
quant-ph
-
Quantum computing has the potential to surpass the capabilities of current classical computers when solving complex problems. Combinatorial optimization has emerged as one of the key target areas for quantum computers as problems found in this field play a cri…
arxiv
Juan Giraldo, José Ossorio, Norha M. Villegas, Gabriel Tamura 等
2023-07-26T17:18:07Z
置信度 0.78
quant-phcs.SE
-
Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requir…
arxiv
Yuta Kikuchi, Conor Mc Keever, Luuk Coopmans, Michael Lubasch 等
2023-03-09T19:00:17Z
置信度 0.78
quant-ph
-
It is expected that quantum computers would enable solving various problems that are beyond the capabilities of the most powerful current supercomputers, which are based on classical technologies. In the last three decades, advances in quantum computing stimul…
arxiv
A. K. Fedorov, N. Gisin, S. M. Beloussov, A. I. Lvovsky
2022-03-31T16:55:39Z
置信度 0.78
quant-phphysics.pop-phphysics.soc-ph
-
We consider a global quantum system (the "Universe") satisfying a double constraint, both on total energy and total momentum. Generalizing the Page and Wootters quantum clock formalism, we provide a model of 3+1 dimensional, non-relativistic, quantum spacetime…
arxiv
Tommaso Favalli, Augusto Smerzi
2022-07-03T10:40:45Z
置信度 0.78
quant-phgr-qc
-
Superconducting radio-frequency (SRF) cavities coupled to transmon circuits have proven to be a promising platform for building high-coherence quantum information processors. An essential aspect of this realization involves designing high quality factor three-…
arxiv
Alessandro Reineri, Silvia Zorzetti, Tanay Roy, Xinyuan You
2023-08-22T19:02:23Z
置信度 0.78
physics.app-phquant-ph
-
A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition from the output. A fr…
arxiv
Kentaro Tamura, Yutaka Shikano
2019-06-11T06:36:30Z
置信度 0.78
quant-phcs.CRcs.DCphysics.data-anstat.CO
-
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-…
arxiv
M. Mottonen, J. J. Vartiainen
2005-04-14T02:02:37Z
置信度 0.78
quant-ph
-
We introduce a constructive procedure that maps all spatial correlations of a broad class of states into temporal correlations between general quantum measurements. This allows us to present temporal phenomena analogous to genuinely multipartite nonlocal pheno…
arxiv
Marcin Markiewicz, Anna Przysiezna, Stephen Brierley, Tomasz Paterek
2013-09-29T19:50:05Z
置信度 0.78
quant-ph
-
It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic st…
arxiv
Michael Zurel, Cihan Okay, Robert Raussendorf, Arne Heimendahl
2021-10-23T23:57:03Z
置信度 0.78
quant-ph
-
This review gives a survey of numerical algorithms and software to simulate quantum computers. It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and p…
arxiv
H. De Raedt, K. Michielsen
2004-06-27T21:59:41Z
置信度 0.78
quant-ph
-
Quantum conference is a process of securely exchanging messages between three or more parties, using quantum resources. A Measurement Device Independent Quantum Dialogue (MDI-QD) protocol, which is secure against information leakage, has been proposed (Quantum…
arxiv
Nayana Das, Goutam Paul
2021-01-14T12:03:08Z
置信度 0.78
quant-phcs.CR
-
We present an end-to-end and practical randomness amplification and privatisation protocol based on Bell tests. This allows the building of device-independent random number generators which output (near-)perfectly unbiased and private numbers, even if using an…
arxiv
Cameron Foreman, Sherilyn Wright, Alec Edgington, Mario Berta 等
2020-09-14T16:25:11Z
置信度 0.78
quant-ph
-
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of relevant information from …
arxiv
Masahito Hayashi, Yuxiang Yang
2022-08-22T14:20:05Z
置信度 0.78
quant-ph
-
Motivated by the expectation that relativistic symmetries might acquire quantum features in Quantum Gravity, we take the first steps towards a theory of ''Doubly'' Quantum Mechanics, a modification of Quantum Mechanics in which the geometrical configurations o…
arxiv
Vittorio D'Esposito, Giuseppe Fabiano, Domenico Frattulillo, Flavio Mercati
2024-12-08T17:10:35Z
置信度 0.78
quant-phgr-qc
-
Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to d-dimensional systems, and I …
arxiv
Daniel Gottesman
1998-02-02T23:02:38Z
置信度 0.78
quant-ph
-
The number of qubits in quantum computers keeps growing, but most quantum programs remain relatively small because of the noisy nature of the underlying quantum hardware. This might lead quantum cloud providers to explore increased hardware utilization, and th…
arxiv
Samuel Ovaskainen, Majid Haghparast, Tommi Mikkonen
2025-07-23T17:23:34Z
置信度 0.78
quant-phcs.CR
-
The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we anticipate an era o…
arxiv
Rutuja Kshirsagar, Amara Katabarwa, Peter D. Johnson
2022-09-22T21:28:12Z
置信度 0.78
quant-ph
-
Field mediated entanglement experiments probe the quantum superposition of macroscopically distinct field configurations. We show that this phenomenon can be described by using a transparent quantum field theoretical formulation of electromagnetism and gravity…
arxiv
Lin-Qing Chen, Flaminia Giacomini, Carlo Rovelli
2022-07-21T16:33:11Z
置信度 0.78
gr-qcquant-ph
-
Portfolio optimization is one of the most studied optimization problems at the intersection of quantum computing and finance. In this work, we develop the first quantum formulation for a portfolio optimization problem with higher-order moments, skewness and ku…
arxiv
Valter Uotila, Julia Ripatti, Bo Zhao
2025-09-01T14:14:56Z
置信度 0.78
quant-ph
-
Large language models (LLMs) have achieved remarkable outcomes in complex problems, including math, coding, and analyzing large amounts of scientific reports. Yet, few works have explored the potential of LLMs in quantum computing. The most challenging problem…
arxiv
Linus Jern, Valter Uotila, Cong Yu, Bo Zhao
2025-04-15T11:56:54Z
置信度 0.78
quant-phcs.AI
-
Heisenberg's uncertainty principle, exemplified by the gamma ray thought experiment, suggests that any finite precision measurement disturbs any observables noncommuting with the measured observable. Here, it is shown that this statement contradicts the limit …
arxiv
Masanao Ozawa
2004-11-10T10:38:18Z
置信度 0.78
quant-ph
-
Quantum computing (QC) seems to show potential for application in machine learning (ML). In particular quantum kernel methods (QKM) exhibit promising properties for use in supervised ML tasks. However, a major disadvantage of kernel methods is their unfavorabl…
arxiv
Kilian Tscharke, Sebastian Issel, Pascal Debus
2024-05-01T04:00:09Z
置信度 0.78
quant-phcs.LG
-
We investigate the classical aspects of Quantum theory and under which description Quantum theory does appear Classical. Although such descriptions or variables are known as "ontological" or "hidden", they are not hidden at all, but are dual classical states (…
arxiv
Diego J. Cirilo-Lombardo, Norma G. Sanchez
2025-01-19T17:26:28Z
置信度 0.78
quant-phgr-qchep-phhep-thmath-ph
-
crossref
Bhagvan Kommadi
2020-12-20T19:02:25Z
置信度 0.70
-
We can simulate algorithms blindly -ultimately interpretation is required.Certain physical systems can be manipulated very quickly -making algorithm simulation also very fast.-100 m baseline -order of magnitude better than current state-of-the-art -Uses ultra-…
crossref
Gabriel Perdue
2024-05-29T02:04:28Z
置信度 0.70
-
crossref
2019-03-29T19:28:25Z
置信度 0.70
-
crossref
Anna Grassellino
2023-06-01T02:13:56Z
置信度 0.70
-
crossref
Matthew Hollister
2021-10-30T02:55:44Z
置信度 0.70
-
Abstract: The chapter "Advancements in Quantum Computing and Information Science" explores the fundamental principles, historical development, and modern applications of quantum computing. Quantum computing leverages the principles of quantum mechanics, utiliz…
crossref
Murali Krishna Pasupuleti
2024-06-30T04:59:35Z
置信度 0.70
-
Quantum mechanics is a highly successful yet a mysterious theory. Quantum Mechanics for Beginners provides an introduction of this fascinating subject to someone with only a high school background in physics and mathematics. This book, except the last chapter …
crossref
M. Suhail Zubairy
2020-06-18T00:29:04Z
置信度 0.70
-
crossref
Ahmed Banafa
2023-07-13T09:00:56Z
置信度 0.70
-
crossref
Dhairyya Agarwal, Shalini D, Srinjoy Ganguly
2023-12-15T10:02:07Z
置信度 0.70
-
crossref
Patrik Recher, Daniel Loss, Jeremy Levy
2011-07-22T10:20:15Z
置信度 0.70
-
crossref
Dhairyya Agarwal, Shalini D, Srinjoy Ganguly
2023-12-15T10:02:07Z
置信度 0.70
-
crossref
2023-07-14T21:39:50Z
置信度 0.70
-
crossref
2023-07-14T21:39:50Z
置信度 0.70
-
crossref
2023-07-14T21:39:50Z
置信度 0.70
-
crossref
Chuck Easttom
2024-08-28T13:02:50Z
置信度 0.70
-
crossref
2013-12-19T23:58:16Z
置信度 0.70
-
crossref
Cheng Hsiao Wu
2025-11-21T18:19:18Z
置信度 0.70
-
crossref
2025-03-05T09:56:56Z
置信度 0.70
-
crossref
2023-07-14T21:39:50Z
置信度 0.70
-
crossref
Cheng Hsiao Wu
2025-11-21T18:19:18Z
置信度 0.70
-
crossref
Elena Yndurain
2025-01-23T20:55:57Z
置信度 0.70
-
crossref
Daowen Qiu
2025-08-29T07:52:13Z
置信度 0.70
-
crossref
Ahmed Banafa
2023-07-13T09:00:56Z
置信度 0.70
-
crossref
Chuck Easttom
2024-08-28T13:02:50Z
置信度 0.70
-
crossref
Cheng Hsiao Wu
2025-11-21T18:19:18Z
置信度 0.70
-
crossref
Cheng Hsiao Wu
2025-11-21T18:19:18Z
置信度 0.70
-
In this chapter we will describe some of the early quantum algorithms. These algorithms are simple and illustrate the main ingredients behind the more useful and powerful quantum algorithms we describe in the subsequent chapters. Since quantum algorithms share…
crossref
Phillip Kaye, Raymond Laflamme, Michele Mosca
2020-11-11T01:48:19Z
置信度 0.70
-
crossref
Chuck Easttom
2024-08-28T13:02:50Z
置信度 0.70
-
crossref
Dietmar Hildenbrand
2021-08-31T18:03:51Z
置信度 0.70
-
crossref
Mariia Mykhailova
2023-11-30T18:58:10Z
置信度 0.70
-
crossref
Jill Cirasella
2012-06-18T18:15:14Z
置信度 0.70
-
Abstract This chapter explains in detail some of the algorithms that convinced physicists and computer scientists that there might be something to this crazy idea of quantum computing. Each algorithm provides a case study of how the properties of quantum state…
crossref
Alice Flarend, Robert Hilborn
2026-07-22T23:57:09Z
置信度 0.70
-
crossref
2023-07-14T21:39:50Z
置信度 0.70
-
crossref
Bhagvan Kommadi
2020-12-20T19:02:25Z
置信度 0.70
-
crossref
Bhagvan Kommadi
2020-12-20T19:02:25Z
置信度 0.70
-
crossref
2023-12-02T00:29:55Z
置信度 0.70
-
crossref
2023-12-02T00:29:55Z
置信度 0.70
-
Cryptography is a method of secure communication between two or more parties. The crucial step is exchanging a key in a secure manner. There are, however, two problems with conventional cryptography. First the sender and the receiver should exchange the key th…
crossref
M. Suhail Zubairy
2020-06-18T04:30:32Z
置信度 0.70