量子计算 · 全部实体（第 88 / 100 页）

本页收录第 8701–8800 条，共 10000 条 · 返回 量子计算 首页

• The theory of the quantum walk comb laser.
  europepmc 2025 置信度 0.80
• Digital quantum simulation of cosmological particle creation with IBM quantum computers.
  europepmc 2025 置信度 0.80
• Surface Passivation of Carbon Dots for Tunable Biological Performance.
  europepmc 2025 置信度 0.80
• Kernel-based dynamic ensemble approach for classifying imbalanced data with overlapping classes.
  europepmc 2026 置信度 0.80
• Multi-Objective Routing Optimization for 6G Communication Networks Using a Quantum Approximate Optimization Algorithm.
  europepmc 2022 置信度 0.80
• An Efficient Method for Contraction of Property-Oriented Basis Sets: A Considerable Reduction of the pecJ-1 and pecJ-2 Basis Sets for the Calculations of Spin-Spin Coupling Constants Involving H, C, N and F Nuclei.
  europepmc 2026 置信度 0.80
• Artificial intelligence in financial market prediction: advancements in machine learning for stock price forecasting.
  europepmc 2025 置信度 0.80
• QOMIC: quantum optimization for motif identification.
  europepmc 2025 置信度 0.80
• Certified randomness using a trapped-ion quantum processor.
  pubmed Liu M, Shaydulin R, Niroula P, DeCross M 等 2025 置信度 0.82
• Nanomaterials in biomedicine, drug delivery and pharmaceutical analysis.
  europepmc 2023 置信度 0.80
• Quantum Approach for Contextual Search, Retrieval, and Ranking of Classical Information.
  europepmc 2024 置信度 0.80
• On the Applicability of Quantum Machine Learning
  europepmc 2023 置信度 0.80
• Benchmarking Quantum Gates and Circuits.
  europepmc 2025 置信度 0.80
• Suppressing nonperturbative gauge errors in the thermodynamic limit using local pseudogenerators.
  europepmc 2025 置信度 0.80
• Robust and optimal control of open quantum systems.
  europepmc 2025 置信度 0.80
• From Field Effect Transistors to Spin Qubits: Focus on Group IV Materials, Architectures and Fabrications.
  europepmc 2025 置信度 0.80
• AI image enhancement for failure analysis in 3D quantum information technology.
  europepmc 2025 置信度 0.80
• Gold Nanoparticles-Functionalized Ultrathin Graphitic Carbon Nitride Nanosheets for Boosting Solar Hydrogen Production: The Role of Plasmon-Induced Interfacial Electric Fields.
  europepmc 2025 置信度 0.80
• The Impact Of The Dynamics In The National Strategy Of The People's Republic Of China On Regional Security And Relations Between China And The West/Nato.
  europepmc 2025 置信度 0.80
• The quantum house of cards.
  europepmc 2024 置信度 0.80
• A Variational Quantum Linear Solver Application to Discrete Finite-Element Methods.
  europepmc 2023 置信度 0.80
• Demonstration of robust and efficient quantum property learning with shallow shadows.
  europepmc 2025 置信度 0.80
• Variational Quantum Search with Exponential Speedup
  europepmc 2022 置信度 0.80
• Precision nanomaterials in colorectal cancer: advancing photodynamic and photothermal therapy.
  europepmc 2025 置信度 0.80
• Hybrid classical and quantum computing for enhanced glioma tumor classification using TCGA data.
  europepmc 2025 置信度 0.80
• Ground-State Energy Estimation on Current Quantum Hardware through the Variational Quantum Eigensolver: A Practical Study.
  europepmc 2025 置信度 0.80
• Graphene supremacy: the duo duo.
  europepmc 2022 置信度 0.80
• Advanced CMOS manufacturing of superconducting qubits on 300 mm wafers.
  europepmc 2024 置信度 0.80
• Impact of COVID-19 Pandemic on Social Determinants of Health Issues of Marginalized Black and Asian Communities: A Social Media Analysis Empowered by Natural Language Processing.
  europepmc 2025 置信度 0.80
• Quantum sampling problems, BosonSampling and quantum supremacy
  Abstract There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the power contrib…
  openalex Austin P. Lund, Michael J. Bremner, Timothy C. Ralph 2017-04-05 置信度 0.72 Quantum computerQuantum algorithmComputer scienceQuantumQuantum process
• Characterizing quantum supremacy in near-term devices
  A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers, achieving so-called qua…
  openalex Sergio Boixo, Sergei V. Isakov, Vadim Smelyanskiy, Ryan Babbush 等 2018-04-20 置信度 0.72 QubitQuantum error correctionQuantum computerQuantum algorithmComputer science
• Quantum computational supremacy
  The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capabilit…
  openalex Aram W. Harrow, Ashley Montanaro 2017-09-01 置信度 0.72 Quantum computerComputer scienceMilestoneQuantumQuantum algorithm
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
  The Quantum Approximate Optimization Algorithm (QAOA) is designed to run on a gate model quantum computer and has shallow depth. It takes as input a combinatorial optimization problem and outputs a string that satisfies a high fraction of the maximum number of…
  openalex Edward Farhi, Aram W. Harrow 2016-02-24 置信度 0.72 OracleQuantum computerQuantum algorithmHamiltonian (control theory)Quantum
• Quantum supremacy of many-particle thermal machines
  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…
  openalex J Jaramillo, M Beau, A del Campo 2016-07-26 置信度 0.72 PhysicsHeat engineQuantumThermalQuantum thermodynamics
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
  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 physic…
  openalex Michael J. Bremner, Ashley Montanaro, Dan Shepherd 2017-04-25 置信度 0.72 QubitQuantum computerComputationMathematicsElectronic circuit
• Closing the "quantum supremacy" gap
  We develop a high-performance tensor-based simulator for random quantum circuits(RQCs) on the new Sunway supercomputer. Our major innovations include: (1) a near-optimal slicing scheme, and a path-optimization strategy that considers both complexity and comput…
  openalex Yong Liu, Xin Liu, Fang Li, Haohuan Fu 等 2021-10-21 置信度 0.72 Computer scienceQubitSupercomputerQuantum computerParallel computing
• Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
  Abstract Noisy intermediate-scale quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving ‘quantum supremacy’, a major milestone in quantum c…
  openalex Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven 等 2020-03-11 置信度 0.72 Benchmark (surveying)Computer scienceMilestoneQuantum computerQuantum
• Classical Simulation of Quantum Supremacy Circuits
  It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underl…
  openalex Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai 等 2020-05-14 置信度 0.72 Quantum computerComputer scienceQuantum sortQuantumQuantum algorithm
• Quantum Supremacy Is Both Closer and Farther than It Appears
  As quantum computers improve in the number of qubits and fidelity, the question of when they surpass state-of-the-art classical computation for a well-defined computational task is attracting much attention. The leading candidate task for this milestone entail…
  openalex Igor L. Markov, Aneeqa Fatima, Sergei V. Isakov, Sergio Boixo 2018-07-27 置信度 0.72 Computer scienceQuantum computerQubitMassively parallelFidelity
• Quantum machine learning
  openalex Jacob Biamonte, Péter Wittek, Nicola Pancotti, Patrick Rebentrost 等 2017-09-01 置信度 0.72 Quantum machine learningComputer scienceQuantumSoftwareField (mathematics)
• Quantum information processing with superconducting circuits: a review
  During the last ten years, superconducting circuits have passed from being interesting physical devices to becoming contenders for near-future useful and scalable quantum information processing (QIP). Advanced quantum simulation experiments have been shown wit…
  openalex G Wendin 2017-07-06 置信度 0.72 PhysicsQubitQuantum computerSuperconducting quantum computingQuantum information
• Quantum supremacy and random circuits
  As Moore's law reaches its limits, quantum computers are emerging with the promise of dramatically outperforming classical computers. We have witnessed the advent of quantum processors with over $50$ quantum bits (qubits), which are expected to be beyond the r…
  openalex Ramis Movassagh 2019-09-11 置信度 0.72 Quantum computerQuantum algorithmQubitComputer scienceQuantum circuit
• Quantum computational advantage using photons
  A light approach to quantum advantage Quantum computational advantage or supremacy is a long-anticipated milestone toward practical quantum computers. Recent work claimed to have reached this point, but subsequent work managed to speed up the classical simulat…
  openalex Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen 等 2020-12-18 置信度 0.72 PhotonSampling (signal processing)QuantumPhotonicsGaussian
• Towards quantum supremacy with lossy scattershot boson sampling
  Boson sampling represents a promising approach to obtain evidence of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians Co…
  openalex Ludovico Latmiral, Nicolò Spagnolo, Fabio Sciarrino 2016-11-06 置信度 0.72 PhysicsBosonLossy compressionQuantumSampling (signal processing)
• Noise Threshold of Quantum Supremacy
  Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we develop a threshold t…
  openalex Keisuke Fujii 2016-10-12 置信度 0.72 Noise (video)QuantumPolitical sciencePhysicsComputer science
• The Born supremacy: quantum advantage and training of an Ising Born machine
  Abstract The search for an application of near-term quantum devices is widespread. Quantum machine learning is touted as a potential utilisation of such devices, particularly those out of reach of the simulation capabilities of classical computers. In this wor…
  openalex Brian Coyle, Daniel Mills, Vincent Danos, Elham Kashefi 2020-07-08 置信度 0.72 Computer scienceQuantumQuantum computerQuantum machine learningQuantum circuit
• Certified Randomness from Quantum Supremacy
  We propose an application for near-term quantum devices: namely, generating cryptographically certified random bits, to use (for example) in proof-of-stake cryptocurrencies. Our protocol repurposes the existing “quantum supremacy” experiments, based on random …
  openalex Scott Aaronson, Shih‐Han Hung 2023-05-16 置信度 0.72 RandomnessRandom oracleComputer sciencePseudorandom number generatorRandom number generation
• Quantum supremacy using a programmable superconducting processor
  The tantalizing promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quant…
  openalex John M. Martinis, Boixo, Sergio, Neven, Hartmut, Arute, Frank 等 2019-10-15 置信度 0.72 QuantumComputer sciencePhysicsQuantum mechanics
• Effect of partial distinguishability on quantum supremacy in Gaussian Boson sampling
  Abstract Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection. In a realistic experimental setting, numerous effects can…
  openalex Junheng Shi, Tim Byrnes 2022-05-11 置信度 0.72 GaussianDetectorSampling (signal processing)BosonBoundary (topology)
• Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation
  Quantum computers can exploit a Hilbert space whose dimension increases exponentially with the number of qubits. In experiment, quantum supremacy has recently been achieved by the Google team by using a noisy intermediate-scale quantum (NISQ) device with over …
  openalex Suguru Endo, Zhenyu Cai, Simon C. Benjamin, Xiao Yuan 2021-01-31 置信度 0.72 Computer scienceQuantum computerQuantum algorithmDimension (graph theory)Quantum
• Hybrid quantum-classical algorithms and quantum error mitigation
  Quantum computers can exploit a Hilbert space whose dimension increases exponentially with the number of qubits. In experiment, quantum supremacy has recently been achieved by the Google team by using a noisy intermediate-scale quantum (NISQ) device with over …
  openalex Cai, Z, Benjamin, SC, Endo, S, Xiao Yuan 2021-01-01 置信度 0.72 Computer scienceQuantum computerQuantum algorithmQubitQuantum sort
• A path towards quantum supremacy with superconducting qubits
  A key milestone on the path towards building a quantum computer will be the demonstration of an algorithm which exceeds the capabilities of any classical computer - achieving so called quantum supremacy. The challenge in developing such an algorithm lies in ba…
  openalex C. Neill 2017-01-01 置信度 0.72 QubitQuantum computerQuantum algorithmQuantumComputer science
• Quantum supremacy and hardness of estimating output probabilities of quantum circuits
  Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the non-collapse of the polynomial …
  openalex Yasuhiro Kondo, Ryuhei Mori, Ramis Movassagh 2022-02-01 置信度 0.72 Quantum computerQuantum algorithmDiscrete mathematicsQuantumQubit
• Quantum supremacy and quantum phase transitions
  Demonstrating the ability of existing quantum platforms to perform certain computational tasks intractable to classical computers represents a cornerstone in quantum computing. Despite the growing number of such proposed ``quantum supreme'' tasks, it remains a…
  openalex Supanut Thanasilp, Jirawat Tangpanitanon, Marc-Antoine Lemonde, Ninnat Dangniam 等 2021-04-22 置信度 0.72 QuantumQuantum phase transitionQuantum simulatorPhysicsStatistical physics
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
  Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information…
  openalex Gian Giacomo Guerreschi, A. Y. Matsuura 2019-05-06 置信度 0.72 QubitComputer scienceQuantum algorithmQuantum computerQuantum
• Noise and the Frontier of Quantum Supremacy
  Noise is the defining feature of the NISQ era, but it remains unclear if noisy quantum devices are capable of quantum speedups. Quantum supremacy experiments have been a major step forward, but gaps remain between the theory behind these experiments and their …
  openalex Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu 2022-02-01 置信度 0.72 Noise (video)Exponential growthRobustness (evolution)QuantumElectronic circuit
• Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
  While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable advantage in quantum dev…
  openalex Jacob Miller, Stephen Sanders, Akimasa Miyake 2017-12-20 置信度 0.72 Computer scienceQubitQuantum computerQuantum error correctionQuantum circuit
• Statistical Aspects of the Quantum Supremacy Demonstration
  In quantum computing, a demonstration of quantum supremacy (or quantum advantage) consists of presenting a task, possibly of no practical value, whose computation is feasible on a quantum device, but cannot be performed by classical computers in any feasible a…
  openalex Yosef Rinott, Tomer Shoham, Gil Kalai 2022-06-22 置信度 0.72 Computer scienceQuantum computerQubitQuantumFidelity
• Barren plateaus in quantum neural network training landscapes
  Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum simulation, optimizat…
  openalex Jarrod R. McClean, Sergio Boixo, Vadim Smelyanskiy, Ryan Babbush 等 2018-11-12 置信度 0.72 Computer scienceQubitParameterized complexityQuantum circuitQuantum algorithm
• Low-Depth Quantum Simulation of Materials
  A proposed quantum algorithm for simulating the electronic structure of materials improves on the efficiency of current approaches, offering a path towards demonstrating quantum supremacy in physical applications.
  openalex Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain 等 2018-03-21 置信度 0.72 QuantumPhysicsPath (computing)Quantum simulatorComputer science
• How many qubits are needed for quantum computational supremacy?
  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 computati…
  openalex Alexander M. Dalzell, Aram W. Harrow, Dax Enshan Koh, Rolando L. La Placa 2020-05-11 置信度 0.72 Polynomial hierarchyQubitQuantum computerStatement (logic)Mathematics
• On the complexity and verification of quantum random circuit sampling
  openalex Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh Vazirani 2018-10-16 置信度 0.72 QuantumVerifiable secret sharingComputational complexity theoryQuantum complexity theoryMeasure (data warehouse)
• Engineering superconducting qubit arrays for Quantum Supremacy
  openalex J. Kelly 2018-03-05 置信度 0.72 QubitSuperconductivityQuantumPhysicsQuantum mechanics
• QIsim: Architecting 10+K Qubit QC Interfaces Toward Quantum Supremacy
  A 10+K qubit Quantum-Classical Interface (QCI) is essential to realize the quantum supremacy. However, it is extremely challenging to architect scalable QCIs due to the complex scalability trade-offs regarding operating temperatures, device and wire technologi…
  openalex Dongmoon Min, Junpyo Kim, Junhyuk Choi, Ilkwon Byun 等 2023-06-16 置信度 0.72 ScalabilityQubitComputer scienceQuantumArchitecture
• Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
  A massive gap exists between current quantum computing (QC) prototypes, and the size and scale required for many proposed QC algorithms. Current QC implementations are prone to noise and variability which affect their reliability, and yet with less than 80 qua…
  openalex Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong 等 2019-04-04 置信度 0.72 Computer scienceQuantum computerCompilerNoise (video)Computer engineering
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
  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 c…
  openalex Theodoros Kapourniotis, Animesh Datta 2019-07-12 置信度 0.72 Overhead (engineering)Sampling (signal processing)QuantumNoise (video)Algorithm
• Google aims for quantum computing supremacy [News]
  Quantum computers have long held the promise of performing certain calculations that are impossible- or at least, entirely impractical-for even the most powerful conventional computers to perform. Now, researchers at a Google laboratory in Goleta, Calif., may …
  openalex Rachel Courtland 2017-05-29 置信度 0.72 QubitQuantum computerComputer scienceQuantumEnhanced Data Rates for GSM Evolution
• The Impact of Quantum Supremacy on Cryptography : Implications for Secure Financial Transactions
  The advent of quantum supremacy, defined as the point at which quantum computers outperform classical systems in solving computational problems, represents a paradigm shift with profound implications for the field of cryptography, particularly in the context o…
  openalex S. K. Dixit 2020-07-20 置信度 0.72 CryptographyQuantum cryptographyComputer securityBusinessComputer science
• Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise?
  Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently simulable with any cla…
  openalex Man‐Hong Yung, Xun Gao 2017-06-27 置信度 0.72 Quantum error correctionQubitQuantumQuantum computerChaotic
• Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
  Instantaneous quantum polynomial time (IQP) is a model of (probably) nonuniversal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the ${l}_{1}$ norm, IQP is c…
  openalex Yuki Takeuchi, Yasuhiro Takahashi 2016-12-27 置信度 0.72 Quantum computerElectronic circuitQuantumMultiplicative functionComputation
• Beyond Quantum Supremacy
  Demonstrations of quantum supremacy have become convincing enough that it's time to think seriously about what comes next.
  openalex Erik P. DeBenedictis 2020-02-01 置信度 0.72 Computer scienceWhite supremacyQuantumLawPolitical science
• Roots of quantum computing supremacy: superposition, entanglement, or complementarity?
  Abstract The 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 s…
  openalex Andrei Khrennikov 2021-04-13 置信度 0.72 Quantum entanglementQuantum probabilityMathematicsQuantum nonlocalityProbabilistic logic
• Noisy intermediate-scale quantum algorithms
  Noisy quantum computers can in principle perform reliable quantum computations, but truly scalable systems require noise levels lower than are presently achieved. Still, moderate-complexity computations can be performed. This review discusses what is possible …
  openalex Kishor Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug 等 2022-02-15 置信度 0.72 Quantum computerComputationScalabilityScale (ratio)Quantum
• Quantum Semi-Supervised Learning with Quantum Supremacy
  Quantum machine learning promises to efficiently solve important problems. There are two persistent challenges in classical machine learning: the lack of labeled data, and the limit of computational power. We propose a novel framework that resolves both issues…
  openalex Zhou Shangnan 2021-10-05 置信度 0.72 Quantum machine learningQuantum algorithmQuantum phase estimation algorithmComputer scienceArtificial intelligence
• Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
  Abstract With quantum computing technologies nearing the era of commercialization and quantum supremacy, machine learning (ML) appears as one of the promising ‘killer’ applications. Despite significant effort, there has been a disconnect between most quantum M…
  openalex Alejandro Perdomo‐Ortiz, Marcello Benedetti, John Realpe-Gómez, Rupak Biswas 2018-06-19 置信度 0.72 Computer scienceQuantum machine learningQuantumQubitQuantum computer
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
  The quantum supremacy experiment, such as Google Sycamore [Nature \textbf{574}, 505 (2019)], poses great challenge for classical verification due to the exponentially-increasing compute cost. Using a new-generation Sunway supercomputer within $8.5$ days, we pr…
  openalex Yong Liu, Yaojian Chen, Chu Guo, Jiawei Song 等 2022-12-09 置信度 0.72 Contraction (grammar)QuantumTensor (intrinsic definition)Computer scienceMathematics
• Parameterized quantum circuits as machine learning models
  Abstract Hybrid quantum–classical systems make it possible to utilize existing quantum computers to their fullest extent. Within this framework, parameterized quantum circuits can be regarded as machine learning models with remarkable expressive power. This Re…
  openalex Marcello Benedetti, Erika Lloyd, Stefan Sack, Mattia Fiorentini 2019-10-17 置信度 0.72 Parameterized complexityComputer scienceVariety (cybernetics)Field (mathematics)Quantum
• Quantum supremacy in a superconducting quantum processor
  The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corre…
  openalex John M. Martinis 2021-07-13 置信度 0.72 Quantum computerQubitComputer scienceQuantumQuantum algorithm
• Powerball and Quantum Supremacy
  In an attempt to communicate better with the nonexpert public, this article explains recent developments in quantum supremacy in a form that is closer to home: lotteries.
  openalex Erik P. DeBenedictis 2019-09-24 置信度 0.72 Computer scienceWhite supremacyComputer securityPolitical scienceLaw
• Echoing the recent Google success: Foundational Roots of Quantum Supremacy
  The recent Google's claim on breakthrough in quantum computing is a gong signal for further analysis of foundational roots of (possible) superiority of some quantum algorithms over the corresponding classical algorithms. This note is a step in this direction. …
  openalex Andrei Khrennikov 2019-11-23 置信度 0.72 MathematicsQuantum probabilityQuantum algorithmQuantumQuantum process
• Practical quantum advantage in quantum simulation
  openalex Andrew J. Daley, Immanuel Bloch, Christian Kokail, Stuart Flannigan 等 2022-07-27 置信度 0.72 Computer scienceQuantum computerFlexibility (engineering)QuantumQuantum technology
• Quantum computational advantage with a programmable photonic processor
  Abstract A quantum computer attains computational advantage when outperforming the best classical computers running the best-known algorithms on well-defined tasks. No photonic machine offering programmability over all its quantum gates has demonstrated quantu…
  openalex Lars S. Madsen, Fabian Laudenbach, Mohsen Falamarzi. Askarani, Fabien Rortais 等 2022-06-01 置信度 0.72 Computer sciencePhotonicsQuantum computerPhotonQuantum
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
  The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evalu…
  openalex Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor Rieffel 等 2019-02-12 置信度 0.72 AnsatzHamiltonian (control theory)Computer scienceQuantumOperator (biology)
• Improved robustness of quantum supremacy for random circuit sampling
  Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the non-collapse of the polynomial …
  openalex Yasuhiro Kondo, Ryuhei Mori, Ramis Movassagh 2021-02-03 置信度 0.72 OmegaBinary logarithmMathematicsQubitDiscrete mathematics
• Logical quantum processor based on reconfigurable atom arrays
  Abstract Suppressing errors is the central challenge for useful quantum computing 1 , requiring quantum error correction (QEC) 2–6 for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is…
  openalex Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li 等 2023-12-06 置信度 0.72 Quantum computerComputer scienceQuantumAtom (system on chip)Parallel computing
• Suppressing quantum errors by scaling a surface code logical qubit
  Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which…
  openalex Google Quantum AI, Rajeev Acharya, I. L. Aleǐner, R. M. Allen 等 2023-02-22 置信度 0.72 QubitComputer scienceError detection and correctionQuantum computerAlgorithm
• Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
  Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One powerful example of such a hybrid quantum-classical approach optimized for classically intractable eigenvalue problems is the varia…
  openalex Jarrod R. McClean, Mollie E. Schwartz, Jonathan Carter, Wibe A. de Jong 2017-04-06 置信度 0.72 Quantum decoherenceExcited stateHierarchyQuantum mechanicsQuantum
• Quantum Supremacy Versus IoT Conspiracy in Smart Cities
  It seems world organizations, because of Covid-19 disaster, are oriented considerably into smart cities quarantine capabilities, digital electronics interactions and digital economics. In this paper, we've tried to challenge IoT5G systems in smart cities from …
  openalex Hassan Kaatuzian 2020-09-16 置信度 0.72 Internet of ThingsComputer scienceComputer security
• Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer
  A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of $53$ qubits, which can perform a random circuit sampling task within $200$ s…
  openalex Xin Liu, Chu Guo, Yong Liu, Yuling Yang 等 2021-11-01 置信度 0.72 SupercomputerQubitQuantum computerComputer scienceQuantum
• What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated About Quantum Supremacy?
  openalex Jack K. Horner, John Symons 2021-01-01 置信度 0.72 QuantumQuantum computerComputer scienceTheoretical computer sciencePhysics
• The Quantum Supremacy Tsirelson Inequality
  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 | 0 n …
  openalex William Kretschmer 2021-10-07 置信度 0.72 MathematicsQubitCombinatoricsQuantumQuantum algorithm
• Classical boson sampling algorithms with superior performance to near-term experiments
  openalex Alex Neville, Chris Sparrow, Raphaël Clifford, Eric R. Johnston 等 2017-10-02 置信度 0.72 BosonPhysicsPhotonQuantum computerSampling (signal processing)
• Quantum optimization using variational algorithms on near-term quantum devices
  Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available, near-term quantum dev…
  openalex Nikolaj Moll, Panagiotis Barkoutsos, Lev S Bishop, Jerry M Chow 等 2018-06-19 置信度 0.72 Quantum computerQuantum algorithmComputer scienceQuantum technologyQuantum phase estimation algorithm
• Additive-error fine-grained quantum supremacy
  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…
  openalex Tomoyuki Morimae, Suguru Tamaki 2020-09-24 置信度 0.72 MathematicsQuantumQubitQuantum computerDiscrete mathematics
• Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
  Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach to demonstrating this on near-term quantum computers is to use random circuit sam…
  openalex Julien Codsi, John van de Wetering 2022-12-16 置信度 0.72 QubitQuantum computerQuantum circuitElectronic circuitQuantum algorithm
• Quantum supremacy and high-dimensional integration
  We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by integrals of oscillating f…
  openalex Juan Miguel Arrazola, Patrick Rebentrost, Christian Weedbrook 2017-12-20 置信度 0.72 Polynomial hierarchyMathematicsBounded functionPolynomialLeverage (statistics)
• Quantum supremacy with analog quantum processors for material science and machine learning
  Quantum supremacy is the ability of quantum processors to outperform classical computers at certain tasks. In digital random quantum circuit approaches for supremacy, the output distribution produced is described by the Porter-Thomas (PT) distribution. In this…
  openalex Jirawat Tangpanitanon, Supanut Thanasilp, Marc-Antoine Lemonde, Dimitris G. Angelakis 2019-06-10 置信度 0.72 Computer scienceQuantumQuantum stateQuantum dynamicsQuantum sort
• Advanced quantum supremacy using a hybrid algorithm for linear systems of equations
  A wealth of quantum algorithms developed during the past decades brought about the concept of quantum supremacy. The state-of-the-art noisy intermediate-scale quantum (NISQ) devices, although imperfect, enable certain computational tasks that are demonstrably …
  openalex Michael Perelshtein, A. I. Pakhomchik, Alexey Melnikov, Alexander Novikov 等 2020-03-28 置信度 0.72 Quantum phase estimation algorithmQuantum computerQuantum algorithmComputer scienceQuantum
• Architectures for quantum simulation showing quantum supremacy
  One of the main aims in the field of simulation is to achieve a speedup, often referred to as quantum computational supremacy, referring to the experimental realization of a device that computationally outperforms classical computers. In this work, we show tha…
  openalex Juan Bermejo-Vega, Dominik Hangleiter, Martin Schwarz, Robert Raussendorf 等 2017-03-01 置信度 0.72 SpeedupComputer scienceCorrectnessQuantum computerRandomness
• Power of data in quantum machine learning
  The use of quantum computing for machine learning is among the most exciting prospective applications of quantum technologies. However, machine learning tasks where data is provided can be considerably different than commonly studied computational tasks. In th…
  openalex Hsin-Yuan Huang, Michael Broughton, Masoud Mohseni, Ryan Babbush 等 2021-05-11 置信度 0.72 Quantum machine learningComputer scienceQuantumArtificial intelligenceRange (aeronautics)