Classical simulation of qubit by a new hardware design and its applications

• URL: http://arxiv.org/abs/2005.11591v1
• Date: Sat, 23 May 2020 19:27:15 GMT
• Title: Classical simulation of qubit by a new hardware design and its applications
• Authors: A. Chouikh, T. Said and M. Bennai
• Abstract summary: We develop a new classical simulation of quantum bit (qubit) by use of analog components. We have also implemented many logical gates (Pauli-X, Hadamard, and Conditional phase-shift gates)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we develop a new classical simulation of quantum bit (qubit) by use of analog components in order to be able to simulate the quantum properties such as the superposition of states. As part of this new approach, we have also implemented many logical gates (Pauli-X, Hadamard, and Conditional phase-shift gates). Simulation of Hadamard and Conditional phase-shift gates using Proteus Design Suite is also presented and discussed in this work.

Related papers

• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Variational protocols for emulating digital gates using analog control with always-on interactions [37.69303106863453]
  We show that we can engineer layers of single-qubit and multi-qubit gates in neutral atom quantum simulators. We discuss how the proposed method can be used to perform refocusing algorithms, SWAP networks, and ultimately quantum chemistry simulations.
  arXiv  Detail & Related papers  (2024-02-12T13:51:26Z)
• Simulating Quantum Systems with NWQ-Sim on HPC [9.754590060356119]
  We provide a brief overview of NWQ-Sim and its implementation in simulating quantum circuit applications. We demonstrate how NWQ-Sim can be used to examine the effects of errors that occur on real quantum devices. We conclude that NWQ-Sim is a useful and flexible tool for simulating quantum circuits and algorithms, with performance advantages and noise-aware simulation capabilities.
  arXiv  Detail & Related papers  (2024-01-12T19:24:14Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Classical circuits can simulate quantum aspects [0.0]
  This study introduces a method for simulating quantum systems using electrical networks. By synthesizing interaction networks, we accurately simulate quantum systems of varying complexity, from $2-$state to $n-$state systems.
  arXiv  Detail & Related papers  (2022-09-19T18:42:06Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Platform tailored co-design of gate-based quantum simulation [0.0]
  We show how knowledge of noise in a system can be exploited to improve the design of gate-based quantum simulation algorithms. Specifically, we derive a theoretical noise model describing unitary gate errors due to heating of the ions' collective motion. We then illustrate how tailored feedforward control can be used to mitigate unitary gate errors and improve the simulation outcome.
  arXiv  Detail & Related papers  (2021-10-29T18:00:20Z)
• Efficient calculation of gradients in classical simulations of variational quantum algorithms [0.0]
  We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
  arXiv  Detail & Related papers  (2020-09-06T21:39:44Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.