Log in

Relevant bibliographies by topics / Quantum computation and simulation / Journal articles

To see the other types of publications on this topic, follow the link: Quantum computation and simulation.

Journal articles on the topic 'Quantum computation and simulation'

Author: Grafiati

Published: 4 June 2025

Last updated: 1 August 2025

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quantum computation and simulation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Fan Heng. "Quantum computation and quantum simulation." Acta Physica Sinica 67, no. 12 (2018): 120301. http://dx.doi.org/10.7498/aps.67.20180710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jozsa, Richard, and Marrten Van den Nest. "Classical simulation complexity of extended Clifford circuits." Quantum Information and Computation 14, no. 7&8 (2014): 633–48. http://dx.doi.org/10.26421/qic14.7-8-7.

Full text

Abstract:

Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line ou

APA, Harvard, Vancouver, ISO, and other styles

3

Manssur, L. R. U., and R. Portugal. "Stochastic simulation of quantum computation." Europhysics Letters (EPL) 63, no. 4 (2003): 492–97. http://dx.doi.org/10.1209/epl/i2003-00560-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

DATTA, ANIMESH, and ANIL SHAJI. "QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL." International Journal of Quantum Information 09, no. 07n08 (2011): 1787–805. http://dx.doi.org/10.1142/s0219749911008416.

Full text

Abstract:

We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of non-classical advantages in computation. Completeness results from computational complexity theory lead to the identification of very disparate problems, and offer a kaleidoscopic view into the realm of quantum enhancements in computation. Emphasis is placed on the "power of one qubit" model, and the boundary between quantum and classical correlations as delineated by quantum discord. A recent result by Eastin on the role of this boundary in the efficient classical simulation of quantum

APA, Harvard, Vancouver, ISO, and other styles

5

GAWRON, P., and J. A. MISZCZAK. "NUMERICAL SIMULATIONS OF MIXED STATE QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 01 (2005): 195–99. http://dx.doi.org/10.1142/s0219749905000748.

Full text

Abstract:

We describe the [Formula: see text] package of functions useful for simulations of quantum algorithms and protocols. The presented package allows one to perform simulations with mixed states. We present numerical implementation of important quantum mechanical operations — partial trace and partial transpose. Those operations are used as building blocks of algorithms for analysis of entanglement and quantum error correction codes. A simulation of Shor's algorithm is presented as an example of package capabilities.

APA, Harvard, Vancouver, ISO, and other styles

6

Nguyen, Binh A. "Simulation of Quantum Computation via MAGMA Computational Algebra System." International Journal of Advanced Trends in Computer Science and Engineering 9, no. 2 (2020): 1757–61. http://dx.doi.org/10.30534/ijatcse/2020/130922020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Buluta, I. M., and S. Hasegawa. "Designing an ion trap for quantum simulation." Quantum Information and Computation 9, no. 5&6 (2009): 361–75. http://dx.doi.org/10.26421/qic9.5-6-1.

Full text

Abstract:

Planar Coulomb crystals have been recently proposed for the implementation of quantum simulation and computation. In order to put this idea into practice we designed a specialized RF ion trap system. The design is based on extensive numerical simulations of planar Coulomb crystals in RF traps and the estimation of the error in quantum simulation and computation. Our trap would have reduced heating rates and large axial confinement frequencies would be available. Moreover, it provides very good optical access and it is easy to construct and operate.

APA, Harvard, Vancouver, ISO, and other styles

8

Luo, Yu-Chen, and Xiao-Peng Li. "Quantum simulation of interacting fermions." Acta Physica Sinica 71, no. 22 (2022): 226701. http://dx.doi.org/10.7498/aps.71.20221756.

Full text

Abstract:

Fermions are basic building blocks in the standard model. Interactions among these elementary particles determine how they assemble and consequently form various states of matter in our nature. Simulating fermionic degrees of freedom is also a central problem in condensed matter physics and quantum chemistry, which is crucial to understanding high-temperature superconductivity, quantum magnetism and molecular structure and functionality. However, simulating interacting fermions by classical computing generically face the minus sign problem, encountering the exponential computation complexity.

APA, Harvard, Vancouver, ISO, and other styles

9

Van den Nest, M. "Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond." Quantum Information and Computation 10, no. 3&4 (2010): 258–71. http://dx.doi.org/10.26421/qic10.3-4-6.

Full text

Abstract:

We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a simple proof of the Gottesman-Knill theorem without resorting to stabilizer techniques. The normal form highlights why Clifford circuits have such limited computational power in spite of their high entangling power. At the same time, the normal form shows how the classical simulation of Clifford circuits fits into the standard way of embedding classical compu

APA, Harvard, Vancouver, ISO, and other styles

10

Cerf, N. J., and S. E. Koonin. "Monte Carlo simulation of quantum computation." Mathematics and Computers in Simulation 47, no. 2-5 (1998): 143–52. http://dx.doi.org/10.1016/s0378-4754(98)00099-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bang, Jeongho, Junghee Ryu, Chang-Woo Lee, Ki Hyuk Yee, Jinhyoung Lee, and Wonmin Son. "Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation." Advanced Quantum Technologies 1, no. 2 (2018): 1800037. http://dx.doi.org/10.1002/qute.201800037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Viamontes, G. F., I. L. Markov, and J. P. Hayes. "Graph-based simulation of quantum computation in the density matrix representation." Quantum Information and Computation 5, no. 2 (2005): 113–30. http://dx.doi.org/10.26421/qic5.2-3.

Full text

Abstract:

Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the securest forms of communication. Simulating such phenomena efficiently is exceedingly difficult because of the vast size of the quantum state space involved. A major complication is caused by errors (noise) due to unwanted interactions between the quantum states and the environment. Consequently, simulating quantum circuits and their associated errors using the density matrix representation is poten

APA, Harvard, Vancouver, ISO, and other styles

13

Okay, Cihan, Michael Zurel, and Robert Raussendorf. "On the extremal points of the Lambda polytopes and classical simulation of quantum computation with magic states." Quantum Information and Computation 21, no. 13&14 (2021): 1091–110. http://dx.doi.org/10.26421/qic21.13-14-2.

Full text

Abstract:

We investigate the $\Lambda$-polytopes, a convex-linear structure recently defined and applied to the classical simulation of quantum computation with magic states by sampling. There is one such polytope, $\Lambda_n$, for every number $n$ of qubits. We establish two properties of the family $\{\Lambda_n, n\in \mathbb{N}\}$, namely (i) Any extremal point (vertex) $A_\alpha \in \Lambda_m$ can be used to construct vertices in $\Lambda_n$, for all $n>m$. (ii) For vertices obtained through this mapping, the classical simulation of quantum computation with magic states can be efficiently reduced

APA, Harvard, Vancouver, ISO, and other styles

14

Suzuki, Ryotaro, Kosuke Mitarai, and Keisuke Fujii. "Computational power of one- and two-dimensional dual-unitary quantum circuits." Quantum 6 (January 24, 2022): 631. http://dx.doi.org/10.22331/q-2022-01-24-631.

Full text

Abstract:

Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. Such classically simulatable circuits are of importance because they illustrate what makes universal quantum computation different from classical computers. In this work, we propose a novel family of classically simulatable circuits by making use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics, and we characterize their computational power. Specifically, we inve

APA, Harvard, Vancouver, ISO, and other styles

15

Kendon, Viv. "Quantum computing using continuous-time evolution." Interface Focus 10, no. 6 (2020): 20190143. http://dx.doi.org/10.1098/rsfs.2019.0143.

Full text

Abstract:

Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of speed. Other types of computation using radically different architectures, including neuromorphic and quantum, promise breakthroughs in both speed and efficiency. Quantum computing exploits the coherence and superposition properties of quantum systems to explore many possible computational paths in parallel. This provides a fundamentally more efficient route

APA, Harvard, Vancouver, ISO, and other styles

16

He, Kaiyong, Xiao Geng, Rutian Huang, Jianshe Liu, and Wei Chen. "Quantum computation and simulation with superconducting qubits*." Chinese Physics B 30, no. 8 (2021): 080304. http://dx.doi.org/10.1088/1674-1056/ac16cf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Kodai, Shiba, Ryo Sugiyama, Koichi Yamaguchi, and Tomah Sogabe. "Quantum Dot Phase Transition Simulation with Hybrid Quantum Annealing via Metropolis-Adjusted Stochastic Gradient Langevin Dynamics." Advances in Condensed Matter Physics 2022 (April 11, 2022): 1–11. http://dx.doi.org/10.1155/2022/9711407.

Full text

Abstract:

We report a hybrid quantum-classical simulation approach for simulating the optical phase transition observed experimentally in the ultrahigh-density type-II InAs quantum dot array. A hybrid simulation scheme, which contains stochastic gradient Langevin dynamics (a well-known Bayesian machine learning algorithm for big data) along with adiabatic quantum annealing, is developed to reproduce the experimentally observed phase transition. By implementing the simulation scheme into a quantum circuit, we successfully verified the phase transition observed in the experiment. Our work demonstrates for

APA, Harvard, Vancouver, ISO, and other styles

18

Bang, Jeongho, Junghee Ryu, Chang-Woo Lee, Ki Hyuk Yee, Jinhyoung Lee, and Wonmin Son. "Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation (Adv. Quantum Technol. 2/2018)." Advanced Quantum Technologies 1, no. 2 (2018): 1870025. http://dx.doi.org/10.1002/qute.201870025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Johansson, Niklas, and Jan-Åke Larsson. "Quantum Simulation Logic, Oracles, and the Quantum Advantage." Entropy 21, no. 8 (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 r

APA, Harvard, Vancouver, ISO, and other styles

20

Kendon, Vivien M., Kae Nemoto, and William J. Munro. "Quantum analogue computing." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 368, no. 1924 (2010): 3609–20. http://dx.doi.org/10.1098/rsta.2010.0017.

Full text

Abstract:

We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is ho

APA, Harvard, Vancouver, ISO, and other styles

21

JANZING, DOMINIK, PAWEL WOCJAN, and THOMAS BETH. "ON THE COMPUTATIONAL POWER OF PHYSICAL INTERACTIONS: BOUNDS ON THE NUMBER OF TIME STEPS FOR SIMULATING ARBITRARY INTERACTION GRAPHS." International Journal of Foundations of Computer Science 14, no. 05 (2003): 889–903. http://dx.doi.org/10.1142/s0129054103002072.

Full text

Abstract:

The most popular model of quantum computation is the quantum circuit model using single and two qubit gates as elementary transformations. Definitions of quantum complexity usually refer to this model. In contrast, we consider the physical interactions among the qubits as the basic computational resource that allows to carry out complex transformations on the quantum register. One method to compare the computational power of different interactions is to examine the complexity of the so-called mutual simulation of interaction Hamiltonians. The physical interaction can simulate other interaction

APA, Harvard, Vancouver, ISO, and other styles

22

Wang, Guoming, Sukin Sim, and Peter D. Johnson. "State Preparation Boosters for Early Fault-Tolerant Quantum Computation." Quantum 6 (October 6, 2022): 829. http://dx.doi.org/10.22331/q-2022-10-06-829.

Full text

Abstract:

Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization la

APA, Harvard, Vancouver, ISO, and other styles

23

PATRA, M. K. "A LOGIC FOR QUANTUM COMPUTATION AND CLASSICAL SIMULATION OF QUANTUM ALGORITHMS." International Journal of Quantum Information 06, no. 02 (2008): 255–80. http://dx.doi.org/10.1142/s0219749908003554.

Full text

Abstract:

The semantics of a language for reasoning about finite-dimensional quantum systems is presented. This language can express most important classes of assertions about quantum systems, including formulas for outputs of all combinational quantum circuits/algorithms. The main result of this paper is an algorithm for efficient translation of a formula of language into an equivalent formula in another decidable language ℝℂ, which is the language of reals and its complex extension. An important consequence is a descriptive characterization of quantum circuits that can be efficiently simulated classic

APA, Harvard, Vancouver, ISO, and other styles

24

Zurel, Michael, Cihan Okay, Robert Raussendorf, and Arne Heimendahl. "Hidden variable model for quantum computation with magic states on qudits of any dimension." Quantum 8 (April 30, 2024): 1323. http://dx.doi.org/10.22331/q-2024-04-30-1323.

Full text

Abstract:

It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic states on qudits with any Hilbert space dimension. This model leads to a classical simulation algorithm for universal quantum computation.

APA, Harvard, Vancouver, ISO, and other styles

25

SAITO, Rui, Koji OKUWAKI, Yuji MOCHIZUKI, et al. "Lattice Folding Simulation of Peptide by Quantum Computation." Journal of Computer Chemistry, Japan -International Edition 9 (2023): n/a. http://dx.doi.org/10.2477/jccjie.2022-0036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Wang, Chen-Xu, Ran He, Rui-Rui Li, et al. "Advances in the study of ion trap structures in Quantum computation and simulation." Acta Physica Sinica 71, no. 13 (2022): 1. http://dx.doi.org/10.7498/aps.70.20220224.

Full text

Abstract:

Ion trap system is one of the main quantum systems to realize quantum computation and simulation. Various ion trap research groups worldwide jointly drive the continuous enrichment of ion trap structures, and develop a series of high-performance three-dimensional ion trap, two-dimensional ion trap chip, and ion traps with integrated components. The structure of ion trap is gradually developing towards miniaturization, high-optical-access and integration, and is demonstrating its outstanding ability in quantum control. Ion traps are able to trap increasingly more ions and precisely manipulate t

APA, Harvard, Vancouver, ISO, and other styles

27

Khan, Khalik, and Sapna Jain. "Error Correction Using Quantum Computation." Journal of Digital Science 5, no. 1 (2023): 12–22. http://dx.doi.org/10.33847/2686-8296.5.1_2.

Full text

Abstract:

Quantum Error Correction (QEC) is an important technique for protecting quantum information against decoherence and errors. This involves the design and implementation of algorithms and techniques to minimize error rates and increase the stability of quantum circuits. One of the key parameters in QEC is the distance of the error- correcting code, which determines the number of errors that can be corrected. Another important parameter is the error probability, which quantifies the likelihood of errors occurring in the quantum system. In this context, the goal of a simulation sweeps like the one

APA, Harvard, Vancouver, ISO, and other styles

28

Bravyi, Sergey, and Robert Konig. "Classical simulation of dissipative fermionic linear optics." Quantum Information and Computation 12, no. 11&12 (2012): 925–43. http://dx.doi.org/10.26421/qic12.11-12-2.

Full text

Abstract:

Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to unitaries and measurements, we allow dissipative evolution governed by a Markovian master equation with linear Lindblad operators. We show that this more general form of fermionic computation is also simulable efficiently by classical means. Given a system of $N$~fermionic modes, our algorithm simulates any such gate in time $O(N^3)$ while a single-mode measure

APA, Harvard, Vancouver, ISO, and other styles

29

Trenev, Dimitar, Pauline J. Ollitrault, Stuart M. Harwood, et al. "Refining resource estimation for the quantum computation of vibrational molecular spectra through Trotter error analysis." Quantum 9 (February 11, 2025): 1630. https://doi.org/10.22331/q-2025-02-11-1630.

Full text

Abstract:

Accurate simulations of vibrational molecular spectra are expensive on conventional computers. Compared to the electronic structure problem, the vibrational structure problem with quantum computers is less investigated. In this work we accurately estimate quantum resources, such as number of logical qubits and quantum gates, required for vibrational structure calculations on a programmable quantum computer. Our approach is based on quantum phase estimation and focuses on fault-tolerant quantum devices. In addition to asymptotic estimates for generic chemical compounds, we present a more detail

APA, Harvard, Vancouver, ISO, and other styles

30

FAN, Heng. "Progress in Superconducting Quantum Computation: Quantum Simulation of Dynamical Phase Transitions." Bulletin of the Chinese Academy of Sciences 34, no. 2 (2020): 102–3. http://dx.doi.org/10.3724/sp.j.7103161522.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Matsuno, Koichiro. "Biological computation running on quantum computation." Biosystems 207 (September 2021): 104467. http://dx.doi.org/10.1016/j.biosystems.2021.104467.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Horvat, Sebastian, Xiaoqin Gao, and Borivoje Dakić. "Universal quantum computation via quantum controlled classical operations." Journal of Physics A: Mathematical and Theoretical 55, no. 7 (2022): 075301. http://dx.doi.org/10.1088/1751-8121/ac4393.

Full text

Abstract:

Abstract A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results in universal quantum computing. Motivated by the latter, we pose the following question: can one perform universal quantum computation by supplementing a set of classical gates with a quantum control, and a set of quantum gates operating solely on the latter? In this work we provide an affirmative answer to this question by considering a computation

APA, Harvard, Vancouver, ISO, and other styles

33

Van den Nest, Maarten. "Simulating quantum computers with probabilistic methods." Quantum Information and Computation 11, no. 9&10 (2011): 784–812. http://dx.doi.org/10.26421/qic11.9-10-5.

Full text

Abstract:

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove th

APA, Harvard, Vancouver, ISO, and other styles

34

Chabaud, Ulysse, Roohollah Ghobadi, Salman Beigi, and Saleh Rahimi-Keshari. "Phase-space negativity as a computational resource for quantum kernel methods." Quantum 8 (November 7, 2024): 1519. http://dx.doi.org/10.22331/q-2024-11-07-1519.

Full text

Abstract:

Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. They are based on a hybrid classical-quantum computation where a function called the quantum kernel is estimated by a quantum device while the rest of computation is performed classically. Quantum advantages may be achieved through this method only if the quantum kernel function cannot be estimated efficiently on a classical computer. In this paper, we provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. These conditions are b

APA, Harvard, Vancouver, ISO, and other styles

35

MATUTTIS, HANS-GEORG, KURT FISCHER, NOBUYASU ITO, and MASAMICHI ISHIKAWA. "AUXILIARY FIELD METHODS FOR THE SIMULATION OF QUANTUM COMPUTATION CIRCUITS." International Journal of Modern Physics C 13, no. 07 (2002): 917–29. http://dx.doi.org/10.1142/s0129183102003681.

Full text

Abstract:

One obstacle in the simulation of quantum circuits is the high dimension of the Hilbert space. Using auxiliary field decompositions known from many-particle simulation, we can transform the mathematical description of the quantum circuit into a combination low-dimensional product states which can be sampled using Monte Carlo techniques. We demonstrate the method using Simon's algorithm for the detection of the period of a function.

APA, Harvard, Vancouver, ISO, and other styles

36

Cardano, Filippo, Francesco Massa, Hammam Qassim, et al. "Quantum walks and wavepacket dynamics on a lattice with twisted photons." Science Advances 1, no. 2 (2015): e1500087. http://dx.doi.org/10.1126/sciadv.1500087.

Full text

Abstract:

The “quantum walk” has emerged recently as a paradigmatic process for the dynamic simulation of complex quantum systems, entanglement production and quantum computation. Hitherto, photonic implementations of quantum walks have mainly been based on multipath interferometric schemes in real space. We report the experimental realization of a discrete quantum walk taking place in the orbital angular momentum space of light, both for a single photon and for two simultaneous photons. In contrast to previous implementations, the whole process develops in a single light beam, with no need of interfero

APA, Harvard, Vancouver, ISO, and other styles

37

Bertoni, A., P. Bordone, R. Brunetti, C. Jacoboni, and S. Reggiani. "Numerical Simulation of Quantum Logic Gates Based on Quantum Wires." VLSI Design 13, no. 1-4 (2001): 97–102. http://dx.doi.org/10.1155/2001/86126.

Full text

Abstract:

A system based on frontier mesoscopic semiconductor technology, able to perform the basic quantum operations needed for quantum computation, is proposed. The elementary quantum bit (qubit) is defined as the state of an electron running along a couple of quantum wires coupled through a potential barrier with variable height and/ or width. A proper design of the system, together with the action of Coulomb interaction of two electrons representing two different qubits, allows the implementation of basic one-qubit and two-qubit quantum logic gates. Numerical simulations confirm the correctness of

APA, Harvard, Vancouver, ISO, and other styles

38

Rocchetto, Andrea. "Stabiliser states are efficiently PAC-learnable." Quantum Information and Computation 18, no. 7&8 (2018): 541–52. http://dx.doi.org/10.26421/qic18.7-8-1.

Full text

Abstract:

The exponential scaling of the wave function is a fundamental property of quantum systems with far reaching implications in our ability to process quantum information. A problem where these are particularly relevant is quantum state tomography. State tomography, whose objective is to obtain an approximate description of a quantum system, can be analysed in the framework of computational learning theory. In this model, Aaronson (2007) showed that quantum states are Probably Approximately Correct (PAC)-learnable with sample complexity linear in the number of qubits. However, it is conjectured th

APA, Harvard, Vancouver, ISO, and other styles

39

Childs, Andrew M., Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su. "Toward the first quantum simulation with quantum speedup." Proceedings of the National Academy of Sciences 115, no. 38 (2018): 9456–61. http://dx.doi.org/10.1073/pnas.1801723115.

Full text

Abstract:

With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, using diverse techniques to tighten error bounds and optimize circuit implementations. Quantum

APA, Harvard, Vancouver, ISO, and other styles

40

Thomas Jayachandran, Aurthur Vimalachandran. "Application Overview of Quantum Computing for Gas Turbine Design and Optimization." AI, Computer Science and Robotics Technology 2022 (August 1, 2022): 1–12. http://dx.doi.org/10.5772/acrt.10.

Full text

Abstract:

Conceptual designs require optimization methods to identify the best fit in the system. The article investigates the application of quantum computation in gas turbine design and simulation problems with current technologies, approaches and potential capabilities. Quantum optimization algorithms and quantum annealers help in predicting overall efficiency and optimizing various operating parameters of the gas turbine. A comparison of both classical and quantum computers has been discussed briefly. The classical model challenges are mitigated with the use of quantum computation. A novel hybrid mo

APA, Harvard, Vancouver, ISO, and other styles

41

Yan, Zhiguang, Yu-Ran Zhang, Ming Gong, et al. "Strongly correlated quantum walks with a 12-qubit superconducting processor." Science 364, no. 6442 (2019): 753–56. http://dx.doi.org/10.1126/science.aaw1611.

Full text

Abstract:

Quantum walks are the quantum analogs of classical random walks, which allow for the simulation of large-scale quantum many-body systems and the realization of universal quantum computation without time-dependent control. We experimentally demonstrate quantum walks of one and two strongly correlated microwave photons in a one-dimensional array of 12 superconducting qubits with short-range interactions. First, in one-photon quantum walks, we observed the propagation of the density and correlation of the quasiparticle excitation of the superconducting qubit and quantum entanglement between qubit

APA, Harvard, Vancouver, ISO, and other styles

42

Zhao, Qiang, Haokun Mao, Yucheng Qiao, Ahmed A. Abd El-Latif, and Qiong Li. "A Remote Quantum Error-Correcting Code Preparation Protocol on Cluster States." Mathematics 11, no. 14 (2023): 3035. http://dx.doi.org/10.3390/math11143035.

Full text

Abstract:

The blind quantum computation (BQC) protocol allows for privacy-preserving remote quantum computations. In this paper, we introduce a remote quantum error correction code preparation protocol for BQC using a cluster state and analyze its blindness in the measurement-based quantum computation model. Our protocol requires fewer quantum resources than previous methods, as it only needs weak coherent pulses, eliminating the need for quantum memory and limited quantum computing. The results of our theoretical analysis and simulations show that our protocol requires fewer quantum resources compared

APA, Harvard, Vancouver, ISO, and other styles

43

Ghosh, K., Y. Naresh та N. Srichakradhar Reddy. "A Theoretical Investigation on the Dimensions and Annealing Effects of InAs/GaAs Quantum Dots for Device Applications at High Bit-Rate Optical Transmission Window of 1.3-1.55 μm". Advanced Materials Research 584 (жовтень 2012): 423–27. http://dx.doi.org/10.4028/www.scientific.net/amr.584.423.

Full text

Abstract:

In this paper, we present theoretical model and computations for tuning the photoluminescence (PL) emission of InAs/GaAs quantum dots at 1.3 -1.55 μm by optimizing its height and base dimensions through quantum mechanical concepts. Simulation on the annealing induced compositional change in the QDs was carried out using Fick’s diffusion model. Results from our computation illustrated that lower base size of 10 nm and larger height QDs of 5.1 nm can be effectively utilized for extending the PL emission to longer wavelengths with minimal blue-shift on annealing. This highlights the potential of

APA, Harvard, Vancouver, ISO, and other styles

44

Hirayama, T., B. Holdom, R. Koniuk, and T. Yavin. "Classical simulation of quantum fields II." Canadian Journal of Physics 84, no. 10 (2006): 879–90. http://dx.doi.org/10.1139/p06-082.

Full text

Abstract:

We consider the classical time evolution of a real scalar field in two-dimensional Minkowski space with a [Formula: see text] interaction. We compute the spatial and temporal two-point correlation functions and extract the renormalized mass of the interacting theory. We find our results are consistent with the one- and two-loop quantum computation. We also perform Monte Carlo simulations of the quantum theory and conclude that the classical scheme is able to produce more accurate results with a fraction of the CPU time. PACS Nos.: 03.70.+k, 03.50.–z, 11.15.Tk

APA, Harvard, Vancouver, ISO, and other styles

45

Cottam, Ron, and Roger Vounckx. "Computation in biological systems as a quantum mechanical simulation." Biosystems 214 (April 2022): 104635. http://dx.doi.org/10.1016/j.biosystems.2022.104635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Karafyllidis, Ioannis G. "Simulation of entanglement generation and variation in quantum computation." Journal of Computational Physics 200, no. 1 (2004): 383–97. http://dx.doi.org/10.1016/j.jcp.2004.04.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Michielsen, K., K. De Raedt, and H. De Raedt. "Simulation of Quantum Computation: A Deterministic Event-Based Approach." Journal of Computational and Theoretical Nanoscience 2, no. 2 (2005): 227–39. http://dx.doi.org/10.1166/jctn.2005.106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jozsa, Richard, and Akimasa Miyake. "Matchgates and classical simulation of quantum circuits." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 464, no. 2100 (2008): 3089–106. http://dx.doi.org/10.1098/rspa.2008.0189.

Full text

Abstract:

Let G ( A , B ) denote the two-qubit gate that acts as the one-qubit SU (2) gates A and B in the even and odd parity subspaces, respectively, of two qubits. Using a Clifford algebra formalism, we show that arbitrary uniform families of circuits of these gates, restricted to act only on nearest neighbour (n.n.) qubit lines, can be classically efficiently simulated. This reproduces a result originally proved by Valiant using his matchgate formalism, and subsequently related by others to free fermionic physics. We further show that if the n.n. condition is slightly relaxed, to allow the same gate

APA, Harvard, Vancouver, ISO, and other styles

49

Reina, John H. "UNDAMENTALS OF INFORMATION AND COMPUTATION IN THE REALM OF THE QUANTA." Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales 33, no. 127 (2023): 201–42. http://dx.doi.org/10.18257/raccefyn.33(127).2009.2387.

Full text

Abstract:

Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlle

APA, Harvard, Vancouver, ISO, and other styles

50

Matsakos, Titos, and Stuart Nield. "Quantum Monte Carlo simulations for financial risk analytics: scenario generation for equity, rate, and credit risk factors." Quantum 8 (April 4, 2024): 1306. http://dx.doi.org/10.22331/q-2024-04-04-1306.

Full text

Abstract:

Monte Carlo (MC) simulations are widely used in financial risk management, from estimating value-at-risk (VaR) to pricing over-the-counter derivatives. However, they come at a significant computational cost due to the number of scenarios required for convergence. If a probability distribution is available, Quantum Amplitude Estimation (QAE) algorithms can provide a quadratic speed-up in measuring its properties as compared to their classical counterparts. Recent studies have explored the calculation of common risk measures and the optimisation of QAE algorithms by initialising the input quantu

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!