Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Bennink, Ryan S."'
Publikováno v:
ACM Transactions on Quantum Computing 5 (4), 1-28 (2024)
We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the
Externí odkaz:
http://arxiv.org/abs/2311.10686
Publikováno v:
Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis (SC-W 2023), November 12--17, 2023, Denver, CO, USA
We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal represen
Externí odkaz:
http://arxiv.org/abs/2311.10687
Autor:
Wang, C. -C. Joseph, Bennink, Ryan S.
Hybrid variational quantum algorithms (VQAs) are promising for solving practical problems such as combinatorial optimization, quantum chemistry simulation, quantum machine learning, and quantum error correction on noisy quantum computers. However, wi
Externí odkaz:
http://arxiv.org/abs/2307.03334
Autor:
Bennink, Ryan S.
In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of parameterized quantum
Externí odkaz:
http://arxiv.org/abs/2208.02360
Autor:
Bennink, Ryan S.
I present a recursive formula for calculating the number of abelian squares of length $n+n$ over an alphabet of size $d$. The presented formula is similar to a previously known formula but has substantially lower complexity when $d\gg n$.
Commen
Commen
Externí odkaz:
http://arxiv.org/abs/2203.11886
Autor:
Lu, Hsuan-Hao, Myilswamy, Karthik V., Bennink, Ryan S., Seshadri, Suparna, Alshaykh, Mohammed S., Liu, Junqiu, Kippenberg, Tobias J., Leaird, Daniel E., Weiner, Andrew M., Lukens, Joseph M.
Publikováno v:
Nat Commun 13, 4338 (2022)
Owing in large part to the advent of integrated biphoton frequency combs (BFCs), recent years have witnessed increased attention to quantum information processing in the frequency domain for its inherent high dimensionality and entanglement compatibl
Externí odkaz:
http://arxiv.org/abs/2108.04124
The method of classical shadows heralds unprecedented opportunities for quantum estimation with limited measurements [H.-Y. Huang, R. Kueng, and J. Preskill, Nat. Phys. 16, 1050 (2020)]. Yet its relationship to established quantum tomographic approac
Externí odkaz:
http://arxiv.org/abs/2012.08997
Autor:
Bennink, Ryan S.
A promising use of quantum computers is to prepare quantum states that model complex domains, such as correlated electron wavefunctions or the underlying distribution of a complex dataset. Such states need to be verified in view of algorithmic approx
Externí odkaz:
http://arxiv.org/abs/2012.08463
Autor:
Hamilton, Kathleen E., Kharazi, Tyler, Morris, Titus, McCaskey, Alexander J., Bennink, Ryan S., Pooser, Raphael C.
Measurement fidelity matrices (MFMs) (also called error kernels) are a natural way to characterize state preparation and measurement errors in near-term quantum hardware. They can be employed in post processing to mitigate errors and substantially in
Externí odkaz:
http://arxiv.org/abs/2006.01805
Autor:
Yeter-Aydeniz, Kubra, Dumitrescu, Eugene F., McCaskey, Alex J., Bennink, Ryan S., Pooser, Raphael C., Siopsis, George
Publikováno v:
Phys. Rev. A 99, 032306 (2019)
Quantum field theory (QFT) simulations are a potentially important application for noisy intermediate scale quantum (NISQ) computers. The ability of a quantum computer to emulate a QFT, therefore, constitutes a natural application-centric benchmark.
Externí odkaz:
http://arxiv.org/abs/1811.12332