Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Aniruddha Bapat"'
Publikováno v:
Physical Review Research, Vol 6, Iss 3, p 033313 (2024)
We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups ov
Externí odkaz:
https://doaj.org/article/7e682a089dc847e1af4b0958273c9756
Publikováno v:
Physical Review Research, Vol 4, Iss 1, p L012023 (2022)
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent, nonuniform couplin
Externí odkaz:
https://doaj.org/article/3bb16cd8e05c40fd9762218a757adebc
Publikováno v:
PRX Quantum, Vol 4, Iss 1, p 010313 (2023)
The swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform swap for the task of permuting qu
Externí odkaz:
https://doaj.org/article/ff07bcc427bc44b1a4b1d52f14fa7af6
Autor:
Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, Samuel King, Eddie Schoute, Hrishee Shastri
Publikováno v:
Quantum, Vol 5, p 533 (2021)
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of le
Externí odkaz:
https://doaj.org/article/d39580091eca4c418db65f4134a7414b
Autor:
Zachary Eldredge, Leo Zhou, Aniruddha Bapat, James R. Garrison, Abhinav Deshpande, Frederic T. Chong, Alexey V. Gorshkov
Publikováno v:
Physical Review Research, Vol 2, Iss 3, p 033316 (2020)
There are many possible architectures of qubit connectivity that designers of future quantum computers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be diff
Externí odkaz:
https://doaj.org/article/11761f431ded4dfea59e9e5c2fec6700
The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of permuting qu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4d3db6303f269168d4ff2469749bce9
Autor:
Alexey V. Gorshkov, Aniruddha Bapat, Andrew M. Childs, Eddie Schoute, Samuel King, Hrishee Shastri
Publikováno v:
Quantum, Vol 5, p 533 (2021)
We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e3d3f62fd0a8fd60c11aa84f1338978
https://quantum-journal.org/papers/q-2021-08-31-533/pdf/
https://quantum-journal.org/papers/q-2021-08-31-533/pdf/
Autor:
Stephen P. Jordan, Aniruddha Bapat
Publikováno v:
Physical Review A. 103
Local tensor methods are a class of optimization algorithms introduced in [Hastings, arXiv:1905.07047v2] as a classical analogue of the quantum approximate optimization algorithm. These algorithms treat the cost function as a Hamiltonian on spin degr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f43144f1ea25905b0d0b8093910279c
https://doi.org/10.1103/physreva.103.052413
https://doi.org/10.1103/physreva.103.052413
Publikováno v:
Proposed for presentation at the TQC 2020 16th Conference on the Theory of Quantum Computation, Communication and Cryptography held July 5-8, 2021 in Riga, Latvia..
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e6a2244028c11bf4ba8fa5aa0c75ea1
https://doi.org/10.2172/1856736
https://doi.org/10.2172/1856736
Publikováno v:
Physical review letters. 126(7)
Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1252a14191731e103deacc82b15b00b
https://pubmed.ncbi.nlm.nih.gov/33666474
https://pubmed.ncbi.nlm.nih.gov/33666474