Journal articles: 'Quantum advantage'

1

McKenzie, James. "Quantum advantage." Physics World 36, no. 6 (June 1, 2023): 19–20. http://dx.doi.org/10.1088/2058-7058/36/06/21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bouland, Adam. "Establishing quantum advantage." XRDS: Crossroads, The ACM Magazine for Students 23, no. 1 (September 20, 2016): 40–44. http://dx.doi.org/10.1145/2983543.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Childs, Andrew M. "Quantum advantage deferred." Nature Physics 13, no. 12 (October 2, 2017): 1148. http://dx.doi.org/10.1038/nphys4272.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ball, Philip. "Turning a quantum advantage." Physics World 35, no. 10 (December 1, 2022): 43–44. http://dx.doi.org/10.1088/2058-7058/35/10/28.

Full text

Abstract:

Vice-president of IBM Quantum Jay Gambetta talks to Philip Ball about the company’s many quantum advances over the last 20 years, as well as its recently announced five-year roadmap to “quantum advantage”.

APA, Harvard, Vancouver, ISO, and other styles

5

Daley, Andrew J., Immanuel Bloch, Christian Kokail, Stuart Flannigan, Natalie Pearson, Matthias Troyer, and Peter Zoller. "Practical quantum advantage in quantum simulation." Nature 607, no. 7920 (July 27, 2022): 667–76. http://dx.doi.org/10.1038/s41586-022-04940-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bravyi, Sergey, David Gosset, and Robert König. "Quantum advantage with shallow circuits." Science 362, no. 6412 (October 18, 2018): 308–11. http://dx.doi.org/10.1126/science.aar3106.

Full text

Abstract:

Quantum effects can enhance information-processing capabilities and speed up the solution of certain computational problems. Whether a quantum advantage can be rigorously proven in some setting or demonstrated experimentally using near-term devices is the subject of active debate. We show that parallel quantum algorithms running in a constant time period are strictly more powerful than their classical counterparts; they are provably better at solving certain linear algebra problems associated with binary quadratic forms. Our work gives an unconditional proof of a computational quantum advantage and simultaneously pinpoints its origin: It is a consequence of quantum nonlocality. The proposed quantum algorithm is a suitable candidate for near-future experimental realizations, as it requires only constant-depth quantum circuits with nearest-neighbor gates on a two-dimensional grid of qubits (quantum bits).

APA, Harvard, Vancouver, ISO, and other styles

7

Luber, Sebastian. "Quantum Advantage für Europa?" Digitale Welt 5, no. 2 (March 8, 2021): 80–84. http://dx.doi.org/10.1007/s42354-021-0343-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kenigsberg, D., A. Mor, and G. Ratsaby. "Quantum advantage without entanglement." Quantum Information and Computation 6, no. 7 (November 2006): 606–15. http://dx.doi.org/10.26421/qic6.7-4.

Full text

Abstract:

We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the \emph{maximal} subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without entanglement.

APA, Harvard, Vancouver, ISO, and other styles

9

Mueck, Leonie, Carmen Palacios-Berraquero, and Divya M. Persaud. "Towards a quantum advantage." Physics World 33, no. 2 (February 2020): 17. http://dx.doi.org/10.1088/2058-7058/33/2/25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Hsin-Yuan, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, et al. "Quantum advantage in learning from experiments." Science 376, no. 6598 (June 10, 2022): 1182–86. http://dx.doi.org/10.1126/science.abn7293.

Full text

Abstract:

Quantum technology promises to revolutionize how we learn about the physical world. An experiment that processes quantum data with a quantum computer could have substantial advantages over conventional experiments in which quantum states are measured and outcomes are processed with a classical computer. We proved that quantum machines could learn from exponentially fewer experiments than the number required by conventional experiments. This exponential advantage is shown for predicting properties of physical systems, performing quantum principal component analysis, and learning about physical dynamics. Furthermore, the quantum resources needed for achieving an exponential advantage are quite modest in some cases. Conducting experiments with 40 superconducting qubits and 1300 quantum gates, we demonstrated that a substantial quantum advantage is possible with today’s quantum processors.

APA, Harvard, Vancouver, ISO, and other styles

11

Zhou, Min-Gang, Xiao-Yu Cao, Yu-Shuo Lu, Yang Wang, Yu Bao, Zhao-Ying Jia, Yao Fu, Hua-Lei Yin, and Zeng-Bing Chen. "Experimental Quantum Advantage with Quantum Coupon Collector." Research 2022 (April 30, 2022): 1–11. http://dx.doi.org/10.34133/2022/9798679.

Full text

Abstract:

An increasing number of communication and computational schemes with quantum advantages have recently been proposed, which implies that quantum technology has fertile application prospects. However, demonstrating these schemes experimentally continues to be a central challenge because of the difficulty in preparing high-dimensional states or highly entangled states. In this study, we introduce and analyze a quantum coupon collector protocol by employing coherent states and simple linear optical elements, which was successfully demonstrated using realistic experimental equipment. We showed that our protocol can significantly reduce the number of samples needed to learn a specific set compared with the classical limit of the coupon collector problem. We also discuss the potential values and expansions of the quantum coupon collector by constructing a quantum blind box game. The information transmitted by the proposed game also broke the classical limit. These results strongly prove the advantages of quantum mechanics in machine learning and communication complexity.

APA, Harvard, Vancouver, ISO, and other styles

12

Chakraborty, Kaushik, Mina Doosti, Yao Ma, Chirag Wadhwa, Myrto Arapinis, and Elham Kashefi. "Quantum Lock: A Provable Quantum Communication Advantage." Quantum 7 (May 23, 2023): 1014. http://dx.doi.org/10.22331/q-2023-05-23-1014.

Full text

Abstract:

Physical unclonable functions(PUFs) provide a unique fingerprint to a physical entity by exploiting the inherent physical randomness. Gao et al. discussed the vulnerability of most current-day PUFs to sophisticated machine learning-based attacks. We address this problem by integrating classical PUFs and existing quantum communication technology. Specifically, this paper proposes a generic design of provably secure PUFs, called hybrid locked PUFs(HLPUFs), providing a practical solution for securing classical PUFs. An HLPUF uses a classical PUF(CPUF), and encodes the output into non-orthogonal quantum states to hide the outcomes of the underlying CPUF from any adversary. Here we introduce a quantum lock to protect the HLPUFs from any general adversaries. The indistinguishability property of the non-orthogonal quantum states, together with the quantum lockdown technique prevents the adversary from accessing the outcome of the CPUFs. Moreover, we show that by exploiting non-classical properties of quantum states, the HLPUF allows the server to reuse the challenge-response pairs for further client authentication. This result provides an efficient solution for running PUF-based client authentication for an extended period while maintaining a small-sized challenge-response pairs database on the server side. Later, we support our theoretical contributions by instantiating the HLPUFs design using accessible real-world CPUFs. We use the optimal classical machine-learning attacks to forge both the CPUFs and HLPUFs, and we certify the security gap in our numerical simulation for construction which is ready for implementation.

APA, Harvard, Vancouver, ISO, and other styles

13

Johansson, Niklas, and Jan-Åke Larsson. "Quantum Simulation Logic, Oracles, and the Quantum Advantage." Entropy 21, no. 8 (August 15, 2019): 800. http://dx.doi.org/10.3390/e21080800.

Full text

Abstract:

Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the advantage of quantum algorithms. We do so by using a simulation framework, Quantum Simulation Logic (QSL), to construct oracles and algorithms that solve some problems with the same success probability and number of queries as the quantum algorithms. The framework can be simulated using only classical resources at a constant overhead as compared to the quantum resources used in quantum computation. Our results clarify the assumptions made and the conditions needed when using quantum oracles. Using the same assumptions on oracles within the simulation framework we show that for some specific algorithms, such as the Deutsch-Jozsa and Simon’s algorithms, there simply is no advantage in terms of query complexity. This does not detract from the fact that quantum query complexity provides examples of how a quantum computer can be expected to behave, which in turn has proved useful for finding new quantum algorithms outside of the oracle paradigm, where the most prominent example is Shor’s algorithm for integer factorization.

APA, Harvard, Vancouver, ISO, and other styles

14

Guha, Tamal, Mir Alimuddin, Sumit Rout, Amit Mukherjee, Some Sankar Bhattacharya, and Manik Banik. "Quantum Advantage for Shared Randomness Generation." Quantum 5 (October 27, 2021): 569. http://dx.doi.org/10.22331/q-2021-10-27-569.

Full text

Abstract:

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 randomness, quantum systems provide an advantage over their classical counterpart. Precisely, we show that appropriate albeit fixed measurements on a shared two-qubit state can generate correlations which cannot be obtained from any possible state on two classical bits. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game, which we call the `non-monopolize social subsidy' game. It turns out that the quantum states leading to the desired advantage must possess non-classicality in the form of quantum discord. On the other hand, while distributing such sources of shared randomness between two parties via noisy channels, quantum channels with zero capacity as well as with classical capacity strictly less than unity perform more efficiently than the perfect classical channel. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.

APA, Harvard, Vancouver, ISO, and other styles

15

Zhong, Han-Sen, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Jian Qin, et al. "Quantum computational advantage using photons." Science 370, no. 6523 (December 18, 2020): 1460–63. http://dx.doi.org/10.1126/science.abe8770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Pan, Jie. "Analyzing noise for quantum advantage." Nature Computational Science 1, no. 12 (December 2021): 776. http://dx.doi.org/10.1038/s43588-021-00178-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Fefferman, Bill. "Toward noise-robust quantum advantage." Nature Physics 16, no. 10 (July 6, 2020): 1007–8. http://dx.doi.org/10.1038/s41567-020-0960-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lostaglio, Matteo, and Gabriel Senno. "Contextual advantage for state-dependent cloning." Quantum 4 (April 27, 2020): 258. http://dx.doi.org/10.22331/q-2020-04-27-258.

Full text

Abstract:

A number of noncontextual models exist which reproduce different subsets of quantum theory and admit a no-cloning theorem. Therefore, if one chooses noncontextuality as one's notion of classicality, no-cloning cannot be regarded as a nonclassical phenomenon. In this work, however, we show that there are aspects of the phenomenology of quantum state cloning which are indeed nonclassical according to this principle. Specifically, we focus on the task of state-dependent cloning and prove that the optimal cloning fidelity predicted by quantum theory cannot be explained by any noncontextual model. We derive a noise-robust noncontextuality inequality whose violation by quantum theory not only implies a quantum advantage for the task of state-dependent cloning relative to noncontextual models, but also provides an experimental witness of noncontextuality.

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Long-Fei, Ming-Ming Du, Wen-Yang Sun, Dong Wang, and Liu Ye. "Nonlocal advantage of quantum coherence under relativistic frame." Modern Physics Letters B 32, no. 31 (November 10, 2018): 1850377. http://dx.doi.org/10.1142/s0217984918503773.

Full text

Abstract:

In this paper, we investigate the influence of the Unruh effect on the achievement of the nonlocal advantage of quantum coherence for a two-qubit system under a relativistic frame. The results show that with the increase of acceleration, it is difficult to realize the nonlocal advantage of quantum coherence and when the acceleration exceeds a certain value, nonlocal advantage of quantum coherence cannot be realized. In addition, we explore the dynamics of Bell nonlocality, steering, quantum coherence, entanglement and quantum discord (QD) under Unruh thermal noise. It is shown that nonlocal advantage of quantum coherence, Bell nonlocality, steering and entanglement experience “sudden death” for a finite acceleration, while quantum coherence and QD vanish only in the limit of an infinite acceleration. We also find that not all nonlocal states can achieve the nonlocal advantage of quantum coherence. It is also demonstrated that the robustness of Bell nonlocality is better than nonlocal advantage of quantum coherence under the influence of the Unruh noise.

APA, Harvard, Vancouver, ISO, and other styles

20

Oliveira, Michael de, Luís S. Barbosa, and Ernesto F. Galvão. "Quantum advantage in temporally flat measurement-based quantum computation." Quantum 8 (April 9, 2024): 1312. http://dx.doi.org/10.22331/q-2024-04-09-1312.

Full text

Abstract:

Several classes of quantum circuits have been shown to provide a quantum computational advantage under certain assumptions. The study of ever more restricted classes of quantum circuits capable of quantum advantage is motivated by possible simplifications in experimental demonstrations. In this paper we study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We propose new constructions for the deterministic computation of arbitrary Boolean functions, drawing on correlations present in multi-qubit Greenberger, Horne, and Zeilinger (GHZ) states. We characterize the necessary measurement complexity using the Clifford hierarchy, and also generally decrease the number of qubits needed with respect to previous constructions. In particular, we identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible, featuring quantum advantage in width and number of gates with respect to classical circuits.

APA, Harvard, Vancouver, ISO, and other styles

21

Gyurik, Casper, Chris Cade, and Vedran Dunjko. "Towards quantum advantage via topological data analysis." Quantum 6 (November 10, 2022): 855. http://dx.doi.org/10.22331/q-2022-11-10-855.

Full text

Abstract:

Even after decades of quantum computing development, examples of generally useful quantum algorithms with exponential speedups over classical counterparts are scarce. Recent progress in quantum algorithms for linear-algebra positioned quantum machine learning (QML) as a potential source of such useful exponential improvements. Yet, in an unexpected development, a recent series of "dequantization" results has equally rapidly removed the promise of exponential speedups for several QML algorithms. This raises the critical question whether exponential speedups of other linear-algebraic QML algorithms persist. In this paper, we study the quantum-algorithmic methods behind the algorithm for topological data analysis of Lloyd, Garnerone and Zanardi through this lens. We provide evidence that the problem solved by this algorithm is classically intractable by showing that its natural generalization is as hard as simulating the one clean qubit model – which is widely believed to require superpolynomial time on a classical computer – and is thus very likely immune to dequantizations. Based on this result, we provide a number of new quantum algorithms for problems such as rank estimation and complex network analysis, along with complexity-theoretic evidence for their classical intractability. Furthermore, we analyze the suitability of the proposed quantum algorithms for near-term implementations. Our results provide a number of useful applications for full-blown, and restricted quantum computers with a guaranteed exponential speedup over classical methods, recovering some of the potential for linear-algebraic QML to become one of quantum computing's killer applications.

APA, Harvard, Vancouver, ISO, and other styles

22

Li, Ying, Ze-Yao Han, Chao-Jian Li, Jin Lü, Xiao Yuan, and Bu-Jiao Wu. "Review on quantum advantages of sampling problems." Acta Physica Sinica 70, no. 21 (2021): 210201. http://dx.doi.org/10.7498/aps.70.20211428.

Full text

Abstract:

Exploiting the coherence and entanglement of quantum many-qubit states, quantum computing can significantly surpass classical algorithms, making it possible to factor large numbers, solve linear equations, simulate many-body quantum systems, etc., in a reasonable time. With the rapid development of quantum computing hardware, many attention has been drawn to explore how quantum computers could go beyond the limit of classical computation. Owing to the need of a universal fault-tolerant quantum computer for many existing quantum algorithms, such as Shor’s factoring algorithm, and considering the limit of near-term quantum devices with small qubit numbers and short coherence times, many recent works focused on the exploration of demonstrating quantum advantages using noisy intermediate-scaled quantum devices and shallow circuits, and hence some sampling problems have been proposed as the candidates for quantum advantage demonstration. This review summarizes quantum advantage problems that are realizable on current quantum hardware. We focus on two notable problems—random circuit simulation and boson sampling—and consider recent theoretical and experimental progresses. After the respective demonstrations of these two types of quantum advantages on superconducting and optical quantum platforms, we expect current and near-term quantum devices could be employed for demonstrating quantum advantages in general problems.

APA, Harvard, Vancouver, ISO, and other styles

23

Patra, Ram Krishna, Sahil Gopalkrishna Naik, Edwin Peter Lobo, Samrat Sen, Tamal Guha, Some Sankar Bhattacharya, Mir Alimuddin, and Manik Banik. "Classical analogue of quantum superdense coding and communication advantage of a single quantum system." Quantum 8 (April 9, 2024): 1315. http://dx.doi.org/10.22331/q-2024-04-09-1315.

Full text

Abstract:

We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games cannot be won given a noiseless 1-bit classical channel from the sender to the receiver. Interestingly, the goal can be perfectly achieved if the channel is assisted with classical shared randomness. This resembles an advantage similar to the quantum superdense coding phenomenon where pre-shared entanglement can enhance the communication utility of a perfect quantum communication line. Quite surprisingly, we show that a qubit communication without any assistance of classical shared randomness can achieve the goal, and hence establishes a novel quantum advantage in the simplest communication scenario. In pursuit of a deeper origin of this advantage, we show that an advantageous quantum strategy must invoke quantum interference both at the encoding step by the sender and at the decoding step by the receiver. We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces. We come up with communication tasks that can be achieved neither with 1-bit of classical communication nor by communicating a polygon system, whereas 1-qubit communication yields a perfect strategy, establishing quantum advantage over them. To this end, we show that the quantum advantages are robust against imperfect encodings-decodings, making the protocols implementable with presently available quantum technologies.

APA, Harvard, Vancouver, ISO, and other styles

24

Novo, Leonardo, Juani Bermejo-Vega, and Raúl García-Patrón. "Quantum advantage from energy measurements of many-body quantum systems." Quantum 5 (June 2, 2021): 465. http://dx.doi.org/10.22331/q-2021-06-02-465.

Full text

Abstract:

The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremacy"). In this work, we investigate whether quantum advantage demonstrations can be achieved for more physically-motivated sampling problems, related to measurements of physical observables. We focus on the problem of sampling the outcomes of an energy measurement, performed on a simple-to-prepare product quantum state – a problem we refer to as energy sampling. For different regimes of measurement resolution and measurement errors, we provide complexity theoretic arguments showing that the existence of efficient classical algorithms for energy sampling is unlikely. In particular, we describe a family of Hamiltonians with nearest-neighbour interactions on a 2D lattice that can be efficiently measured with high resolution using a quantum circuit of commuting gates (IQP circuit), whereas an efficient classical simulation of this process should be impossible. In this high resolution regime, which can only be achieved for Hamiltonians that can be exponentially fast-forwarded, it is possible to use current theoretical tools tying quantum advantage statements to a polynomial-hierarchy collapse whereas for lower resolution measurements such arguments fail. Nevertheless, we show that efficient classical algorithms for low-resolution energy sampling can still be ruled out if we assume that quantum computers are strictly more powerful than classical ones. We believe our work brings a new perspective to the problem of demonstrating quantum advantage and leads to interesting new questions in Hamiltonian complexity.

APA, Harvard, Vancouver, ISO, and other styles

25

Yang, Siyi, Naixu Guo, Miklos Santha, and Patrick Rebentrost. "Quantum Alphatron: quantum advantage for learning with kernels and noise." Quantum 7 (November 8, 2023): 1174. http://dx.doi.org/10.22331/q-2023-11-08-1174.

Full text

Abstract:

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 the Alphatron, an algorithm to learn distributions related to kernelized regression, which they also applied to the learning of two-layer neural networks. In this work, we provide quantum versions of the Alphatron in the fault-tolerant setting. In a well-defined learning model, this quantum algorithm is able to provide a polynomial speedup for a large range of parameters of the underlying concept class. We discuss two types of speedups, one for evaluating the kernel matrix and one for evaluating the gradient in the stochastic gradient descent procedure. We also discuss the quantum advantage in the context of learning of two-layer neural networks. Our work contributes to the study of quantum learning with kernels and from samples.

APA, Harvard, Vancouver, ISO, and other styles

26

Coles, Patrick J. "Seeking quantum advantage for neural networks." Nature Computational Science 1, no. 6 (June 2021): 389–90. http://dx.doi.org/10.1038/s43588-021-00088-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bravyi, Sergey, David Gosset, Robert König, and Marco Tomamichel. "Quantum advantage with noisy shallow circuits." Nature Physics 16, no. 10 (July 6, 2020): 1040–45. http://dx.doi.org/10.1038/s41567-020-0948-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Yuan, Xiao. "A quantum-computing advantage for chemistry." Science 369, no. 6507 (August 27, 2020): 1054–55. http://dx.doi.org/10.1126/science.abd3880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ambainis, Andris. "Superlinear Advantage for Exact Quantum Algorithms." SIAM Journal on Computing 45, no. 2 (January 2016): 617–31. http://dx.doi.org/10.1137/130939043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Horodecki, M., and M. Piani. "On quantum advantage in dense coding." Journal of Physics A: Mathematical and Theoretical 45, no. 10 (February 24, 2012): 105306. http://dx.doi.org/10.1088/1751-8113/45/10/105306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Mukherjee, Kaushiki, Biswajit Paul, and Debasis Sarkar. "Revealing advantage in a quantum network." Quantum Information Processing 15, no. 7 (March 23, 2016): 2895–921. http://dx.doi.org/10.1007/s11128-016-1301-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Ueno, Shin-ichi, Yasunari Miyake, and Masahiro Asada. "Advantage of Strained Quantum Wire Lasers." Japanese Journal of Applied Physics 31, Part 1, No. 2A (February 15, 1992): 286–87. http://dx.doi.org/10.1143/jjap.31.286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chen, Jimmy. "The Future of Quantum Computer Advantage." American Journal of Computational Mathematics 13, no. 04 (2023): 619–31. http://dx.doi.org/10.4236/ajcm.2023.134034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

MADHOK, VAIBHAV, and ANIMESH DATTA. "QUANTUM DISCORD AS A RESOURCE IN QUANTUM COMMUNICATION." International Journal of Modern Physics B 27, no. 01n03 (November 26, 2012): 1345041. http://dx.doi.org/10.1142/s0217979213450410.

Full text

Abstract:

As quantum technologies move from the issues of principle to those of practice, it is important to understand the limitations on attaining tangible quantum advantages. In the realm of quantum communication, quantum discord captures the damaging effects of a decoherent environment. This is a consequence of quantum discord quantifying the advantage of quantum coherence in quantum communication. This establishes quantum discord as a resource for quantum communication processes. We discuss this progress, which derives a quantitative relation between the yield of the fully quantum Slepian–Wolf (FQSW) protocol in the presence of noise and the quantum discord of the state involved. The significance of quantum discord in noisy versions of teleportation, super-dense coding, entanglement distillation and quantum state merging are discussed. These results lead to open questions regarding the tradeoff between quantum entanglement and discord in choosing the optimal quantum states for attaining palpable quantum advantages in noisy quantum protocols.

APA, Harvard, Vancouver, ISO, and other styles

36

Chakrabarti, Shouvanik, Rajiv Krishnakumar, Guglielmo Mazzola, Nikitas Stamatopoulos, Stefan Woerner, and William J. Zeng. "A Threshold for Quantum Advantage in Derivative Pricing." Quantum 5 (June 1, 2021): 463. http://dx.doi.org/10.22331/q-2021-06-01-463.

Full text

Abstract:

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 (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing – the re-parameterization method – that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. We find that the benchmark use cases we examine require 8k logical qubits and a T-depth of 54 million. We estimate that quantum advantage would require executing this program at the order of a second. While the resource requirements given here are out of reach of current systems, we hope they will provide a roadmap for further improvements in algorithms, implementations, and planned hardware architectures.

APA, Harvard, Vancouver, ISO, and other styles

37

Stamatopoulos, Nikitas, Guglielmo Mazzola, Stefan Woerner, and William J. Zeng. "Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms." Quantum 6 (July 20, 2022): 770. http://dx.doi.org/10.22331/q-2022-07-20-770.

Full text

Abstract:

We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a quadratic error scaling advantage in market risk computation. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities, usually called greeks. By numerically simulating the quantum gradient estimation algorithms on financial derivatives of practical interest, we demonstrate that not only can we successfully estimate the greeks in the examples studied, but that the resource requirements can be significantly lower in practice than what is expected by theoretical complexity bounds. This additional advantage in the computation of financial market risk lowers the estimated logical clock rate required for financial quantum advantage from Chakrabarti et al. [Quantum 5, 463 (2021)] by a factor of ~7, from 50MHz to 7MHz, even for a modest number of greeks by industry standards (four). Moreover, we show that if we have access to enough resources, the quantum algorithm can be parallelized across 60 QPUs, in which case the logical clock rate of each device required to achieve the same overall runtime as the serial execution would be ~100kHz. Throughout this work, we summarize and compare several different combinations of quantum and classical approaches that could be used for computing the market risk of financial derivatives.

APA, Harvard, Vancouver, ISO, and other styles

38

Melnikov, Alexey A., Leonid E. Fedichkin, and Alexander Alodjants. "Predicting quantum advantage by quantum walk with convolutional neural networks." New Journal of Physics 21, no. 12 (December 16, 2019): 125002. http://dx.doi.org/10.1088/1367-2630/ab5c5e.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Madsen, Lars S., Fabian Laudenbach, Mohsen Falamarzi Askarani, Fabien Rortais, Trevor Vincent, Jacob F. F. Bulmer, Filippo M. Miatto, et al. "Quantum computational advantage with a programmable photonic processor." Nature 606, no. 7912 (June 1, 2022): 75–81. http://dx.doi.org/10.1038/s41586-022-04725-x.

Full text

Abstract:

AbstractA 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 quantum computational advantage: previous machines1,2 were largely restricted to static gate sequences. Earlier photonic demonstrations were also vulnerable to spoofing3, in which classical heuristics produce samples, without direct simulation, lying closer to the ideal distribution than do samples from the quantum hardware. Here we report quantum computational advantage using Borealis, a photonic processor offering dynamic programmability on all gates implemented. We carry out Gaussian boson sampling4 (GBS) on 216 squeezed modes entangled with three-dimensional connectivity5, using a time-multiplexed and photon-number-resolving architecture. On average, it would take more than 9,000 years for the best available algorithms and supercomputers to produce, using exact methods, a single sample from the programmed distribution, whereas Borealis requires only 36 μs. This runtime advantage is over 50 million times as extreme as that reported from earlier photonic machines. Ours constitutes a very large GBS experiment, registering events with up to 219 photons and a mean photon number of 125. This work is a critical milestone on the path to a practical quantum computer, validating key technological features of photonics as a platform for this goal.

APA, Harvard, Vancouver, ISO, and other styles

40

Boerkamp, Martijn. "IBM achieve quantum advantage without error correction." Physics World 36, no. 8 (August 1, 2023): 6i. http://dx.doi.org/10.1088/2058-7058/36/08/08.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Dunjko, Vedran. "Quantum learning unravels quantum system." Science 376, no. 6598 (June 10, 2022): 1154–55. http://dx.doi.org/10.1126/science.abp9885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Mancilla, Javier, and Christophe Pere. "A Preprocessing Perspective for Quantum Machine Learning Classification Advantage in Finance Using NISQ Algorithms." Entropy 24, no. 11 (November 15, 2022): 1656. http://dx.doi.org/10.3390/e24111656.

Full text

Abstract:

Quantum Machine Learning (QML) has not yet demonstrated extensively and clearly its advantages compared to the classical machine learning approach. So far, there are only specific cases where some quantum-inspired techniques have achieved small incremental advantages, and a few experimental cases in hybrid quantum computing are promising, considering a mid-term future (not taking into account the achievements purely associated with optimization using quantum-classical algorithms). The current quantum computers are noisy and have few qubits to test, making it difficult to demonstrate the current and potential quantum advantage of QML methods. This study shows that we can achieve better classical encoding and performance of quantum classifiers by using Linear Discriminant Analysis (LDA) during the data preprocessing step. As a result, the Variational Quantum Algorithm (VQA) shows a gain of performance in balanced accuracy with the LDA technique and outperforms baseline classical classifiers.

APA, Harvard, Vancouver, ISO, and other styles

43

Plachta, Stephen Z. D., Markus Hiekkamäki, Abuzer Yakaryılmaz, and Robert Fickler. "Quantum advantage using high-dimensional twisted photons as quantum finite automata." Quantum 6 (June 30, 2022): 752. http://dx.doi.org/10.22331/q-2022-06-30-752.

Full text

Abstract:

Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental implementation of multi-qubit QFAs using the orbital angular momentum (OAM) of single photons. We implement different high-dimensional QFAs encoded on a single photon, where multiple qubits operate in parallel without the need for complicated multi-partite operations. Using two to eight OAM quantum states to implement up to four parallel qubits, we show that a high-dimensional QFA is able to detect the prime numbers 5 and 11 while outperforming classical finite automata in terms of the required memory. Our work benefits from the ease of encoding, manipulating, and deciphering multi-qubit states encoded in the OAM degree of freedom of single photons, demonstrating the advantages structured photons provide for complex quantum information tasks.

APA, Harvard, Vancouver, ISO, and other styles

44

Miano, Mariana Godoy Vazquez, Lucas Gomes Pinheiro, Sthefanie Costa Amaro, and Victor Luis Rodrigues Pereira Ferreira. "COMPARAÇÃO DE DESEMPENHO DO ALGORITMO DE DEUTSCH-JOZSA NAS LINGUAGENS QUÂNTICAS SILQ E QASM." REVISTA TECNOLÓGICA DA FATEC AMERICANA 11, no. 01 (December 8, 2023): 47–67. http://dx.doi.org/10.47283/244670492023110147.

Full text

Abstract:

Due to the importance given to information in the last few decades, a performance and processing advantage of information becomes relevant, something that can be found through quantum computing. The Deutsch-Jozsa Algorithm is the first example of a quantum algorithm that offers an exponential advantage against classical algorithms, whether in a local environment or through cloud simulators. Seeking to explore the advantages of quantum computation, the Deutsch-Jozsa Algorithm was implemented in two quantum programming languages, namely the high level language Silq, focused on the execution of the algorithm on a local environment through VSCode, which offers a cleaner and friendly sintaxe as well as quantum uncomputation, and also in OpenQASM, a low level language meant to interact with quantum circuits, used to better visualizethe Deutsch-Jozsa Algorithm. This paper aims to make the differences between high and low-level quantum languages clear, as well as incentivize the change to a new paradigm

APA, Harvard, Vancouver, ISO, and other styles

45

Bova, Francesco, Avi Goldfarb, and Roger G. Melko. "Quantum Economic Advantage." Management Science, December 2, 2022. http://dx.doi.org/10.1287/mnsc.2022.4578.

Full text

Abstract:

A quantum computer exhibits quantum advantage when it can perform a calculation that a classical computer is unable to complete. It follows that a company with a quantum computer would be a monopolist in the market for such a calculation if its only competitor was a company with a classical computer. Conversely, economic outcomes are unclear if quantum computers do not exhibit a quantum advantage, but classical and quantum computers have different cost structures. We model a Cournot duopoly where a quantum computing company competes against a classical computing company. The model features an asymmetric variable cost structure between the two companies and the potential for an asymmetric fixed cost structure, where each firm can invest in scaling its hardware to expand its respective market. We find that even if (1) the companies can complete identical calculations, and thus there is no quantum advantage, and (2) it is more expensive to scale the quantum computer, the quantum computing company may be more profitable and also invest more in market creation due to efficiency gains from using quantum algorithms. Finally, we provide examples of settings where the classical computer can also perform a calculation, but not in a cost-effective enough manner to be commercially viable. In such a setting, the quantum computing company becomes a monopolist despite exhibiting no quantum advantage. Taken together, quantum computers may not need to display a quantum advantage to be able to generate a quantum economic advantage for the companies that deploy them. This paper was accepted by D. J. Wu, information systems. Funding: R. G. Melko is supported by the Natural Sciences and Engineering Research Council of Canada, Canada Research Chair program, and the Perimeter Institute for Theoretical Physics. Research at the Perimeter Institute is supported in part by the Government of Canada through the Department of Innovation, Science and Economic Development Canada and by the Province of Ontario through the Ministry of Colleges and Universities. A. Goldfarb is supported by the Sloan Foundation and the Social Sciences and Humanities Council of Canada. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2022.4578 .

APA, Harvard, Vancouver, ISO, and other styles

46

Bova, Francesco, Avi Goldfarb, and Roger Melko. "Quantum Economic Advantage." SSRN Electronic Journal, 2022. http://dx.doi.org/10.2139/ssrn.4028340.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Pérez-Guijarro, Jordi, Alba Pagés-Zamora, and Javier R. Fonollosa. "Relation between quantum advantage in supervised learning and quantum computational advantage." IEEE Transactions on Quantum Engineering, 2023, 1–17. http://dx.doi.org/10.1109/tqe.2023.3347476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Assouly, R., R. Dassonneville, T. Peronnin, A. Bienfait, and B. Huard. "Quantum advantage in microwave quantum radar." Nature Physics, June 29, 2023. http://dx.doi.org/10.1038/s41567-023-02113-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Renner, Renato, and Ramona Wolf. "Quantum Advantage in Cryptography." AIAA Journal, February 1, 2023, 1–16. http://dx.doi.org/10.2514/1.j062267.

Full text

Abstract:

Ever since its inception, cryptography has been caught in a vicious circle: Cryptographers keep inventing methods to hide information, and cryptanalysts break them, prompting cryptographers to invent even more sophisticated encryption schemes, and so on. But could it be that quantum information technology breaks this circle? At first sight, it looks as if it just lifts the competition between cryptographers and cryptanalysts to the next level. Indeed, quantum computers will render most of today’s public key cryptosystems insecure. Nonetheless, there are good reasons to believe that cryptographers will ultimately prevail over cryptanalysts. Quantum cryptography allows us to build communication schemes whose secrecy relies only on the laws of physics and some minimum assumptions about the cryptographic hardware—leaving basically no room for an attack. While we are not yet there, this paper provides an overview of the principles and state-of-the-art of quantum cryptography, as well as an assessment of current challenges and prospects for overcoming them.

APA, Harvard, Vancouver, ISO, and other styles

50

"Light on quantum advantage." Nature Materials 20, no. 3 (February 25, 2021): 273. http://dx.doi.org/10.1038/s41563-021-00953-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Quantum advantage'

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