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

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

• Quantum message-passing algorithm for optimal and efficient decoding
  Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) for decoding classical data encoded using a binary linear code with tree Tanner graph that is transmitted over a pure-state CQ channel [Renes, NJP 19 072001 (20…
  arxiv Christophe Piveteau, Joseph M. Renes 2021-09-16T18:01:12Z 置信度 0.78 quant-phcs.IT
• Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad
  We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables one to give guarant…
  arxiv M. B. Hastings 2019-04-30T16:09:24Z 置信度 0.78 quant-ph
• Quantum algorithms for Second-Order Cone Programming and Support Vector Machines
  We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time $\widetilde{O} \left( n\sqrt{r} \frac{ζκ}{δ^2} \log \left(1/ε\right) \right)$ where $r$ is the rank and $n$ the dimension of the SOCP, $δ$ bounds the di…
  arxiv Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi 2019-08-19T12:02:13Z 置信度 0.78 quant-phcs.DSstat.ML
• Benchmarking the Quantum Approximate Optimization Algorithm
  The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectation value, and a ratio closely related to the approximation ratio. The set of prob…
  arxiv Madita Willsch, Dennis Willsch, Fengping Jin, Hans De Raedt 等 2019-07-04T12:22:31Z 置信度 0.78 quant-ph
• An efficient quantum-classical hybrid algorithm for distorted alphanumeric character identification
  An algorithm for image processing is proposed. The proposed algorithm, which can be viewed as a quantum-classical hybrid algorithm, can transform a low-resolution bitonal image of a character from the set of alphanumeric characters (A-Z, 0-9) into a high-resol…
  arxiv Ankur Pal, Abhishek Shukla, Anirban Pathak 2022-12-25T05:31:51Z 置信度 0.78 quant-phcs.GR
• Implementable Hybrid Quantum Ant Colony Optimization Algorithm
  We propose a new hybrid quantum algorithm based on the classical Ant Colony Optimization algorithm to produce approximate solutions for NP-hard problems, in particular optimization problems. First, we discuss some previously proposed Quantum Ant Colony Optimiz…
  arxiv Mikel Garcia de Andoin, Javier Echanobe 2021-07-08T13:50:51Z 置信度 0.78 quant-ph
• Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions
  We present classical and quantum algorithms for approximating partition functions of classical Hamiltonians at a given temperature. Our work has two main contributions: first, we modify the classical algorithm of Štefankovič, Vempala and Vigoda (\emph{J.~ACM},…
  arxiv Srinivasan Arunachalam, Vojtech Havlicek, Giacomo Nannicini, Kristan Temme 等 2020-09-23T17:27:28Z 置信度 0.78 quant-ph
• Double-bracket quantum algorithms for diagonalization
  This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be cho…
  arxiv Marek Gluza 2022-06-23T15:13:46Z 置信度 0.78 quant-ph
• Variational quantum algorithm with information sharing
  We introduce an optimisation method for variational quantum algorithms and experimentally demonstrate a 100-fold improvement in efficiency compared to naive implementations. The effectiveness of our approach is shown by obtaining multi-dimensional energy surfa…
  arxiv Chris N. Self, Kiran E. Khosla, Alistair W. R. Smith, Frederic Sauvage 等 2021-03-30T08:42:46Z 置信度 0.78 quant-ph
• Quantum Algorithms for Learning and Testing Juntas
  In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: - whose sample complexity has no dependence on …
  arxiv Alp Atici, Rocco A. Servedio 2007-07-24T13:17:55Z 置信度 0.78 quant-phcs.LG
• Making the cut: two methods for breaking down a quantum algorithm
  Despite the promise that fault-tolerant quantum computers can efficiently solve classically intractable problems, it remains a major challenge to find quantum algorithms that may reach computational advantage in the present era of noisy, small-scale quantum ha…
  arxiv Miguel Murça, Duarte Magano, Yasser Omar 2023-05-17T18:00:06Z 置信度 0.78 quant-ph
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
  Quantum Phase Estimation is one of the most useful quantum computing algorithms for quantum chemistry and as such, significant effort has been devoted to designing efficient implementations. In this article, we introduce TFermion, a library designed to estimat…
  arxiv Pablo A. M. Casares, Roberto Campos, M. A. Martin-Delgado 2021-10-12T11:20:37Z 置信度 0.78 quant-ph
• Quantum-inspired algorithms in practice
  We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems invo…
  arxiv Juan Miguel Arrazola, Alain Delgado, Bhaskar Roy Bardhan, Seth Lloyd 2019-05-24T19:17:30Z 置信度 0.78 quant-phcs.DS
• A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization
  We study the performance scaling of three quantum algorithms for combinatorial optimization: measurement-feedback coherent Ising machines (MFB-CIM), discrete adiabatic quantum computation (DAQC), and the Dürr-Hoyer algorithm for quantum minimum finding (DH-QMF…
  arxiv Krishanu Sankar, Artur Scherer, Satoshi Kako, Sam Reifenstein 等 2021-05-07T22:35:02Z 置信度 0.78 quant-ph
• Quantum Algorithms for the Pathwise Lasso
  We present a novel quantum high-dimensional linear regression algorithm with an $\ell_1$-penalty based on the classical LARS (Least Angle Regression) pathwise algorithm. Similarly to available classical algorithms for Lasso, our quantum algorithm provides the …
  arxiv Joao F. Doriguello, Debbie Lim, Chi Seng Pun, Patrick Rebentrost 等 2023-12-21T18:57:54Z 置信度 0.78 quant-phcs.LGmath.OCstat.ML
• Finding eigenvectors with a quantum variational algorithm
  This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a parametrized quantum circuit. The eigenvector is…
  arxiv Juan Carlos Garcia-Escartin 2023-11-22T17:36:42Z 置信度 0.78 quant-ph
• Quantum Analogical Modeling: A General Quantum Computing Algorithm for Predicting Language Behavior
  This paper proposes a general quantum algorithm that can be applied to any classical computer program. Each computational step is written using reversible operators, but the operators remain classical in that the qubits take on values of only zero and one. Thi…
  arxiv Royal Skousen 2005-10-18T16:47:39Z 置信度 0.78 quant-ph
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints
  Semidefinite programs are optimization methods with a wide array of applications, such as approximating difficult combinatorial problems. One such semidefinite program is the Goemans-Williamson algorithm, a popular integer relaxation technique. We introduce a …
  arxiv Taylor L. Patti, Jean Kossaifi, Anima Anandkumar, Susanne F. Yelin 2022-06-30T03:15:23Z 置信度 0.78 quant-ph
• A Fast Exact Quantum Algorithm for Solitude Verification
  Solitude verification is arguably one of the simplest fundamental problems in distributed computing, where the goal is to verify that there is a unique contender in a network. This paper devises a quantum algorithm that exactly solves the problem on an anonymo…
  arxiv Seiichiro Tani 2016-12-16T00:08:48Z 置信度 0.78 quant-phcs.DCcs.DS
• Efficient realization of quantum algorithms with qudits
  The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of q…
  arxiv Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov 2021-11-08T11:09:37Z 置信度 0.78 quant-ph
• A Variational Quantum Algorithm For Approximating Convex Roofs
  Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to produce a sequence of …
  arxiv George Androulakis, Ryan McGaha 2022-03-04T02:30:35Z 置信度 0.78 quant-ph
• A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system
  We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is iteratively applied to th…
  arxiv Jeongho Bang, Seung-Woo Lee, Chang-Woo Lee, Hyunseok Jeong 2012-12-28T14:33:36Z 置信度 0.78 quant-phmath-ph
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
  We apply our recent Quantum Approximate Optimization Algorithm to the combinatorial problem of bounded occurrence Max E3LIN2. The input is a set of linear equations each of which contains exactly three boolean variables and each equation says that the sum of t…
  arxiv Edward Farhi, Jeffrey Goldstone, Sam Gutmann 2014-12-18T20:38:18Z 置信度 0.78 quant-ph
• From Schrödinger's Equation to the Quantum Search Algorithm
  The quantum search algorithm is a technique for searching N possibilities in only sqrt(N) steps. Although the algorithm itself is widely known, not so well known is the series of steps that first led to it, these are quite different from any of the generally k…
  arxiv Lov K. Grover 2001-09-22T12:13:50Z 置信度 0.78 quant-ph
• Quantum Alphatron: quantum advantage for learning with kernels and noise
  At the interface of machine learning and quantum computing, an important question is what distributions can be learned provably with optimal sample complexities and with quantum-accelerated time complexities. In the classical case, Klivans and Goel discussed t…
  arxiv Siyi Yang, Naixu Guo, Miklos Santha, Patrick Rebentrost 2021-08-26T09:36:20Z 置信度 0.78 quant-ph
• Variational Quantum Singular Value Decomposition
  Singular value decomposition is central to many problems in engineering and scientific fields. Several quantum algorithms have been proposed to determine the singular values and their associated singular vectors of a given matrix. Although these algorithms are…
  arxiv Xin Wang, Zhixin Song, Youle Wang 2020-06-03T15:32:08Z 置信度 0.78 quant-phcs.LG
• Improved Bounds on Quantum Learning Algorithms
  In this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al. conjectured that for any class C of Boolean functions, the number of quantum black-box queries w…
  arxiv Alp Atici, Rocco A. Servedio 2004-11-18T20:14:16Z 置信度 0.78 quant-phcs.LG
• Quantum Regularized Least Squares
  Linear regression is a widely used technique to fit linear models and finds widespread applications across different areas such as machine learning and statistics. In most real-world scenarios, however, linear regression problems are often ill-posed or the und…
  arxiv Shantanav Chakraborty, Aditya Morolia, Anurudh Peduri 2022-06-27T09:43:39Z 置信度 0.78 quant-phcs.DS
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
  Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of resea…
  arxiv Nicolas PD Sawaya, Albert T Schmitz, Stuart Hadfield 2022-03-28T01:01:12Z 置信度 0.78 quant-phcs.DM
• Improved Quantum Query Complexity on Easier Inputs
  Quantum span program algorithms for function evaluation sometimes have reduced query complexity when promised that the input has a certain structure. We design a modified span program algorithm to show these improvements persist even without a promise ahead of…
  arxiv Noel T. Anderson, Jay-U Chung, Shelby Kimmel, Da-Yeon Koh 等 2023-03-01T03:40:37Z 置信度 0.78 quant-phcs.DS
• Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
  Qubit Mapping is a critical aspect of implementing quantum circuits on real hardware devices. Currently, the existing algorithms for qubit mapping encounter difficulties when dealing with larger circuit sizes involving hundreds of qubits. In this paper, we int…
  arxiv Chin-Yi Cheng, Chien-Yi Yang, Yi-Hsiang Kuo, Ren-Chu Wang 等 2022-10-04T01:47:11Z 置信度 0.78 quant-phcs.ARcs.ET
• A case study of variational quantum algorithms for a job shop scheduling problem
  Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approaches. Variat…
  arxiv David Amaro, Matthias Rosenkranz, Nathan Fitzpatrick, Koji Hirano 等 2021-09-08T16:05:50Z 置信度 0.78 quant-ph
• Phase-Sensitive Measurements on a Fermi-Hubbard Quantum Processor
  Fermionic quantum processors are a promising platform for quantum simulation of correlated fermionic matter. In this work, we study a hardware-efficient protocol for measuring complex expectation values of the time-evolution operator, commonly referred to as L…
  arxiv Alberto R. Cavallar, Luis Escalera-Moreno, Titus Franz, Timon Hilker 等 2025-09-01T17:30:41Z 置信度 0.78 quant-phcond-mat.quant-gascond-mat.str-el
• Quantum Algorithm Software for Condensed Matter Physics
  Realizing the promise of quantum computation for condensed matter many-body problems depends as much on software as on hardware, yet the area is reviewed far more often than it is quantified. We address this gap by pairing a focused survey of quantum algorithm…
  arxiv T. Farajollahpour 2025-06-11T00:24:03Z 置信度 0.78 cond-mat.str-elcond-mat.dis-nn
• Quantum algorithm for estimating volumes of convex bodies
  Estimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an $n$-dimensional convex body within multiplicative error $ε$ usi…
  arxiv Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung, Tongyang Li 等 2019-08-11T13:13:47Z 置信度 0.78 quant-phcs.DSmath.OC
• Quantum algorithm for the Navier Stokes equations by using the streamfunction vorticity formulation and the lattice Boltzmann method
  A new algorithm for solving the Navier-Stokes equations (NSE) on a quantum device is presented. For the fluid flow equations the stream function-vorticity formulation is adopted, while the lattice Boltzmann method (LBM) is utilized for solving the correspondin…
  arxiv Ljubomir Budinski 2021-03-05T17:07:33Z 置信度 0.78 quant-ph
• Quantum circuit debugging and sensitivity analysis via local inversions
  As the width and depth of quantum circuits implemented by state-of-the-art quantum processors rapidly increase, circuit analysis and assessment via classical simulation are becoming unfeasible. It is crucial, therefore, to develop new methods to identify signi…
  arxiv Fernando A. Calderon-Vargas, Timothy Proctor, Kenneth Rudinger, Mohan Sarovar 2022-04-12T19:39:31Z 置信度 0.78 quant-ph
• Instance Independence of Single Layer Quantum Approximate Optimization Algorithm on Mixed-Spin Models at Infinite Size
  This paper studies the application of the Quantum Approximate Optimization Algorithm (QAOA) to spin-glass models with random multi-body couplings in the limit of a large number of spins. We show that for such mixed-spin models the performance of depth $1$ QAOA…
  arxiv Jahan Claes, Wim van Dam 2021-02-24T03:19:15Z 置信度 0.78 quant-phcond-mat.dis-nn
• Synthesis of Quantum Circuits with an Island Genetic Algorithm
  crossref 2026-07-30T16:15:30Z 置信度 0.70
• Algorithm 1: Quantum circuit initialization.
  crossref 2022-01-03T03:32:35Z 置信度 0.70
• A Bayesian analysis of classical shadows
  Abstract The method of classical shadows proposed by Huang, Kueng, and Preskill heralds remarkable opportunities for quantum estimation with limited measurements. Yet its relationship to established quantum tomographic approaches, particularly those based on l…
  crossref Joseph M. Lukens, Kody J. H. Law, Ryan S. Bennink 2021-07-16T10:03:33Z 置信度 0.70
• Is Grover’s Algorithm a Quantum Hidden Subgroup Algorithm?
  crossref Samuel J. Lomonaco, Louis H. Kauffman 2007-11-20T20:23:52Z 置信度 0.70
• End-to-end quantum algorithm for nonlinear fluid dynamics with bounded quantum advantage
  crossref Anonymous 2026-07-17T15:18:27Z 置信度 0.70
• Figure 2: Quantum genetic algorithm simulation.
  crossref 2025-01-21T03:41:16Z 置信度 0.70
• A Short Path Quantum Algorithm for Exact Optimization
  We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree D ; this p…
  crossref M. B. Hastings 2018-07-26T20:43:05Z 置信度 0.70
• Quantum inverse iteration algorithm for programmable quantum simulators
  Abstract We propose a quantum inverse iteration algorithm, which can be used to estimate ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian i…
  crossref Oleksandr Kyriienko 2020-01-17T11:03:05Z 置信度 0.70
• Quantum Algorithm
  crossref 2024-07-12T00:29:50Z 置信度 0.70
• Singular Value Decomposition Quantum Algorithm for Quantum Biology
  crossref 2024-05-17T16:40:15Z 置信度 0.70
• Quantum Molecular Docking with a Quantum-Inspired Algorithm
  crossref 2024-07-29T11:57:57Z 置信度 0.70
• Quantum Algorithm for Factoring, 1994; Shor
  crossref 2011-08-29T12:11:46Z 置信度 0.70
• Quantum algorithm in quantum network systems
  crossref I. Sakamoto 2004-06-15T14:09:03Z 置信度 0.70
• Difference of Convex Algorithm for Warm‐Start Quantum Approximate Optimization Algorithm
  Abstract The Quantum Approximate Optimization Algorithm (QAOA) stands as a hybrid classical‐quantum algorithm utilized for addressing combinatorial optimization challenges. Central to its effectiveness is the initial mixer, which is responsible for instigating…
  crossref Phuc Nguyen Ha Huy, Viet Hung Nguyen, Anh Son Ta 2025-05-20T06:52:12Z 置信度 0.70
• Noise Removal in IBM Real Time Quantum Computer with Deviation Quantum Algorithm in Comparison with Variational Quantum Eigensolver Algorithm
  crossref P. Venkata Ramana, T. Suresh Balakrishnan 2024-10-04T17:30:08Z 置信度 0.70
• Phased Attribute Reduction Algorithm: Phased Joint Attribute Reduction Algorithm Based on Quantum Genetic Algorithm
  crossref xiaoxia zhang, Jiangtao Zhang, Xi He 2025-06-21T15:38:32Z 置信度 0.70
• Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm
  We demonstrate that with an optimally tuned scheduling function, adiabatic quantum computing (AQC) can readily solve a quantum linear system problem (QLSP) with O (κ poly(log (κ ε))) runtime, where κ is the condition number, and ε is the target accuracy. This …
  openalex Dong An, Lin Lin 2019-09-12 置信度 0.72 Hermitian matrixQuantum algorithmQuantum computerMathematicsAdiabatic process
• Quantum Task Impact Learning (QTIL)Algorithm on Quantum Reinforcement Learning
  Abstract Quantum reinforcement learning (QRL) can change computational paradigms through quantum parallelism. A novel algorithm called Quantum Task Impact Learning (QTIL) is coined in this paper, specially designed for the Cart-Pole environment. QTIL combines …
  preprints R. Palanivel, P. Muthulakshmi 2024 置信度 0.74
• Quantum Algorithm for Solving the Fundamental Paradox of Tribology
  crossref 2017-06-05T10:27:59Z 置信度 0.70
• Quantum-inspired Algorithm for the Collatz Conjecture
  crossref Inho Choi 2025-09-18T23:05:20Z 置信度 0.70
• Worm Algorithm for Problems of Quantum and Classical Statistics
  crossref 2010-12-28T17:05:55Z 置信度 0.70
• Quantum Algorithm for the Parity Problem, 1985; Deutsch
  crossref 2011-08-29T12:11:46Z 置信度 0.70
• An efficient quantum algorithm for preparation of uniform quantum superposition states
  crossref Alok Shukla, Prakash Vedula 2024-01-29T08:02:53Z 置信度 0.70
• Efficient Quantum Cooling Algorithm for Fermionic Systems
  We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known ground state. We derive …
  crossref Lucas Marti, Refik Mansuroglu, Michael J. Hartmann 2025-02-18T16:11:28Z 置信度 0.70
• A blueprint for demonstrating quantum supremacy with superconducting qubits.
  europepmc 2018 置信度 0.80
• Beyond quantum supremacy: the hunt for useful quantum computers.
  europepmc 2019 置信度 0.80
• General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier.
  europepmc 2019 置信度 0.80
• Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model.
  europepmc 2017 置信度 0.80
• Hello quantum world! Google publishes landmark quantum supremacy claim.
  europepmc 2019 置信度 0.80
• The Q-Day Dilemma and the Quantum Supremacy/Advantage Conjecture
  europepmc 2022 置信度 0.80
• Quantum supremacy: A three minute guide.
  europepmc 2019 置信度 0.80
• Quantum supremacy using a programmable superconducting processor.
  The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorith…
  europepmc Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon 等 2019 置信度 0.80 Quantum computerQuantumRealization (probability)Computer scienceDimension (graph theory)
• Sample Complexity of Device-Independently Certified "Quantum Supremacy".
  europepmc 2019 置信度 0.80
• Quantum supremacy: some fundamental concepts.
  Quantum computation was envisioned by Feynman as a valuable means of solving quantum problems [1]. The question is, how do we prove the superiority of quantum computing over classical devices? A common misconception in describing the power of a quantum compute…
  europepmc Man‐Hong Yung 2018-07-04 置信度 0.80 QuantumBiologyPhysicsQuantum mechanics
• The race for quantum supremacy: pushing the classical limit for photonic hardware.
  europepmc 2019 置信度 0.80
• 'Quantum supremacy' revisited: low-complexity, deterministic solutions of the original Deutsch-Jozsa problem in classical physical systems.
  europepmc 2023 置信度 0.80
• Solving the Sampling Problem of the Sycamore Quantum Circuits.
  europepmc 2022 置信度 0.80
• Towards the Simplest Model of Quantum Supremacy: Atomic Boson Sampling in a Box Trap.
  europepmc 2023 置信度 0.80
• Tensorization of the strong data processing inequality for quantum chi-square divergences
  It is well-known that any quantum channel $\mathcal{E}$ satisfies the data processing inequality (DPI), with respect to various divergences, e.g., quantum $χ^2_κ$divergences and quantum relative entropy. More specifically, the data processing inequality states…
  arxiv Yu Cao, Jianfeng Lu 2019-04-13T16:02:05Z 置信度 0.78 quant-phcs.ITmath-ph
• Quantum scientists for disarmament: a manifesto
  We, as researchers in quantum science and technology, are publishing this manifesto to express our deep concerns about the current geopolitical situation and the global race to rearm. We firmly oppose all forms of militarization in our societies and, in partic…
  arxiv Quantum Scientists for Disarmament 2026-01-13T10:22:16Z 置信度 0.78 physics.soc-phquant-ph
• A no-go theorem on the nature of the gravitational field beyond quantum theory
  Recently, table-top experiments involving massive quantum systems have been proposed to test the interface of quantum theory and gravity. In particular, the crucial point of the debate is whether it is possible to conclude anything on the quantum nature of the…
  arxiv Thomas D. Galley, Flaminia Giacomini, John H. Selby 2020-12-02T19:00:03Z 置信度 0.78 quant-phgr-qc
• A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex
  Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work we develop a general…
  arxiv Zixuan Hu, Kade Head-Marsden, David A. Mazziotti, Prineha Narang 等 2021-01-13T19:00:02Z 置信度 0.78 quant-ph
• Switching quantum reference frames in the N-body problem and the absence of global relational perspectives
  Given the importance of quantum reference frames (QRFs) to both quantum and gravitational physics, it is pertinent to develop a systematic method for switching between the descriptions of physics relative to different choices of QRFs, which is valid in both fi…
  arxiv Augustin Vanrietvelde, Philipp A. Hoehn, Flaminia Giacomini 2018-09-13T17:58:13Z 置信度 0.78 quant-phgr-qc
• Quantum tunneling of composite object coupled with quantized radiation field
  We study quantum tunneling of a composite object, which has a dipole or quadrupole moment coupled with quantized (photon or gravitational) radiation field, through a δ potential barrier. The dipole or quadrupole moment is represented by an oscillator in the re…
  arxiv Fumika Suzuki, Friedemann Queisser 2017-05-15T19:57:26Z 置信度 0.78 gr-qchep-thquant-ph
• Reaching Quantum Supremacy with a Boson Sampling Experiment
  Boson Sampling represents a promising witness 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 Conjecture and has bee…
  arxiv Ludovico Latmiral 2015-11-25T19:06:44Z 置信度 0.78 quant-phphysics.chem-ph
• Fluctuation-dissipation theorem for non-equilibrium quantum systems
  The fluctuation-dissipation theorem (FDT) is a central result in statistical physics, both for classical and quantum systems. It establishes a relationship between the linear response of a system under a time-dependent perturbation and time correlations of cer…
  arxiv Mohammad Mehboudi, Anna Sanpera, Juan M. R. Parrondo 2017-05-10T22:53:40Z 置信度 0.78 quant-phcond-mat.stat-mech
• Quantum state of fields in $SU(\infty)$ Quantum Gravity ($SU(\infty)$-QGR)
  Our Universe is ruled by quantum mechanics and should be treated as a quantum system. $SU(\infty)$-QGR is a recently proposed quantum model for the Universe, in which gravity is associated to $SU(\infty)$ symmetry of its Hilbert space. Fragmentation of its inf…
  arxiv Houri Ziaeepour 2024-02-28T11:06:45Z 置信度 0.78 gr-qchep-thquant-ph
• The Bethe Ansatz as a Quantum Circuit
  The Bethe ansatz represents an analytical method enabling the exact solution of numerous models in condensed matter physics and statistical mechanics. When a global symmetry is present, the trial wavefunctions of the Bethe ansatz consist of plane wave superpos…
  arxiv Roberto Ruiz, Alejandro Sopena, Max Hunter Gordon, Germán Sierra 等 2023-09-25T18:00:06Z 置信度 0.78 quant-phcond-mat.stat-mechcond-mat.str-elhep-th
• The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims
  My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a meeting point of the laws of computation and the laws of quantum mechanics. We described a computational complexity argument against the feasibility of quantum computers: we i…
  arxiv Gil Kalai 2020-08-12T09:11:55Z 置信度 0.78 quant-phcs.CC
• Satellite-based quantum steering under the influence of spacetime curvature of the Earth
  Spacetime curvature of the Earth deforms wavepackets of photons sent from the Earth to satellites, thus influencing the quantum state of light. We show that Gaussian steering of photon pairs, which are initially prepared in a two-mode squeezed state, is affect…
  arxiv Tonghua Liu, Jiliang Jing, Jieci Wang 2018-08-28T03:30:41Z 置信度 0.78 quant-phgr-qc
• Generalization in Quantum Machine Learning: a Quantum Information Perspective
  Quantum classification and hypothesis testing are two tightly related subjects, the main difference being that the former is data driven: how to assign to quantum states $ρ(x)$ the corresponding class $c$ (or hypothesis) is learnt from examples during training…
  arxiv Leonardo Banchi, Jason Pereira, Stefano Pirandola 2021-02-17T19:35:21Z 置信度 0.78 quant-phcs.LGstat.ML
• A Threshold for Quantum Advantage in Derivative Pricing
  We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TAR…
  arxiv Shouvanik Chakrabarti, Rajiv Krishnakumar, Guglielmo Mazzola, Nikitas Stamatopoulos 等 2020-12-07T16:07:00Z 置信度 0.78 quant-phcs.ETq-fin.CP
• Probing tripartite entanglement and coherence dynamics in pure and mixed independent classical environments
  Quantum information processing exploits non-local functionality that has led to significant breakthroughs in the successful deployment of quantum mechanical protocols. In this regard, we address the dynamics of entanglement and coherence for three non-interact…
  arxiv Atta Ur Rahman, Muhammad Javed, Arif Ullah, Quantum Optics 等 2021-07-23T14:18:40Z 置信度 0.78 quant-ph
• Comment on the Quantum Supremacy Claim by Google
  Quantum computation promises to execute certain computational tasks on time scales much faster than any known algorithm on an existing classical computer, for example calculating the prime factors of large integers. Recently a research team from Google claimed…
  arxiv Anirudh Reddy, Benjamin Perez-Garcia, Adenilton Jose da Silva, Thomas Konrad 2021-08-29T20:57:42Z 置信度 0.78 quant-ph
• Theory of variational quantum simulation
  The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imagin…
  arxiv Xiao Yuan, Suguru Endo, Qi Zhao, Ying Li 等 2018-12-20T18:52:17Z 置信度 0.78 quant-ph
• Amplitude Estimation from Quantum Signal Processing
  Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In this situation, we find…
  arxiv Patrick Rall, Bryce Fuller 2022-07-18T14:22:10Z 置信度 0.78 quant-ph
• Quantum supremacy with spin squeezed atomic ensembles
  We propose a method to achieve quantum supremacy using ensembles of qubits, using only spin squeezing, basis rotations, and Fock state measurements. Each ensemble is assumed to be controllable only with its total spin. Using a repeated sequence of random basis…
  arxiv Yueheng Shi, Junheng Shi, Tim Byrnes 2022-04-25T16:42:37Z 置信度 0.78 quant-ph
• Quantum metrology in the noisy intermediate-scale quantum era
  Quantum metrology pursues the physical realization of higher-precision measurements to physical quantities than the classically achievable limit by exploiting quantum features, such as entanglement and squeezing, as resources. It has potential applications in …
  arxiv Lin Jiao, Wei Wu, Si-Yuan Bai, Jun-Hong An 2023-07-15T04:05:47Z 置信度 0.78 quant-ph
• Resource-Dependent Complexity of Quantum Channels
  We introduce a new framework for quantifying the complexity of quantum channels, grounded in a suitably chosen resource set. This class of convex functions is designed to analyze the complexity of both open and closed quantum systems. By leveraging Lipschitz n…
  arxiv Roy Araiza, Yidong Chen, Marius Junge, Peixue Wu 2023-03-20T17:44:57Z 置信度 0.78 quant-phmath-phmath.OA
• A No-summoning theorem in Relativistic Quantum Theory
  Alice gives Bob an unknown localized physical state at some point P. At some point Q in the causal future of P, Alice will ask Bob for the state back. Bob knows this, but does not know at which point Q until the request is made. Bob can satisfy Alice's summons…
  arxiv Adrian Kent 2011-01-24T18:20:03Z 置信度 0.78 quant-phgr-qchep-th
• Video for An Overview of Quantum Algorithms: From Quantum Supremacy to Shor Factorization
  crossref 2020-09-29T09:22:27Z 置信度 0.70
• The Era of Quantum Supremacy
  crossref 2021-09-09T00:05:41Z 置信度 0.70