Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Quantum Inf Process

Search In Journal Title:

Abbravation: Quantum Information Processing

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/128_2014_542

Search In DOI:

ISSN

1573-1332

Search In ISSN:
Search In Title Of Papers:

An ancillabased quantum simulation framework for

Authors: Ammar Daskin Sabre Kais
Publish Date: 2016/12/23
Volume: 16, Issue: 1, Pages: 33-
PDF Link

Abstract

The success probability in an ancillabased circuit generally decreases exponentially in the number of qubits consisted in the ancilla Although the probability can be amplified through the amplitude amplification process the input dependence of the amplitude amplification makes difficult to sequentially combine two or more ancillabased circuits A new version of the amplitude amplification known as the oblivious amplitude amplification runs independently of the input to the system register This allows us to sequentially combine two or more ancillabased circuits However this type of the amplification only works when the considered system is unitary or nonunitary but somehow close to a unitary In this paper we present a general framework to simulate nonunitary processes on ancillabased quantum circuits in which the success probability is maximized by using the oblivious amplitude amplification In particular we show how to extend a nonunitary matrix to an almost unitary matrix We then employ the extended matrix by using an ancillabased circuit design along with the oblivious amplitude amplification Measuring the distance of the produced matrix to the closest unitary matrix a lower bound for the fidelity of the final state obtained from the oblivious amplitude amplification process is presented Numerical simulations for random matrices of different sizes show that independent of the system size the final amplified probabilities are generally around 075 and the fidelity of the final state is mostly high and around 095 Furthermore we discuss the complexity analysis and show that combining two such ancillabased circuits a matrix product can be implemented This may lead us to efficiently implement matrix functions represented as infinite matrix products on quantum computers


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. Nonlocality in pure and mixed n-qubit X states
  2. Super quantum discord for general two qubit X states
  3. Non-Markovian entanglement dynamics of two qubits interacting with a common electromagnetic field
  4. A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
  5. Quantum Fisher information for moving three-level atom
  6. A quantum model for autonomous learning automata
  7. Monogamy of correlations versus monogamy of entanglement
  8. Quantum discord for the general two-qubit case
  9. A quantization procedure based on completely positive maps and Markov operators
  10. On conclusive eavesdropping and measures of mutual information in quantum key distribution
  11. The CGMV method for quantum walks
  12. Concurrence in the framework of coherent states
  13. Noncyclic geometric quantum computation and preservation of entanglement for a two-qubit Ising model
  14. Noise and the magic square game
  15. Geometry and dynamics of one-norm geometric quantum discord
  16. Nuclear polarization and entanglement in spin systems
  17. Controllability and Universal Three-qubit Quantum Computation with Trapped Electron States
  18. Quantum relative phase, m -tangle, and multi-local Lorentz-group invariant
  19. Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
  20. Dynamics of one-dimensional tight-binding models with arbitrary time-dependent external homogeneous fields
  21. Classical–quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation
  22. Multi-party quatum private compariso protocol with $$$$-level etagled states
  23. Lower bound of quantum uncertainty from extractable classical information
  24. Quantum image encryption based on restricted geometric and color transformations
  25. Analysis and improvement of the watermark strategy for quantum images based on quantum Fourier transform

Search Result: