Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum digital-to-analog conversion algorithm using decoherence
118
0
0.0
(
0
)
Authors
Akira SaiToh
Ask ChatGPT about the research
No Arabic abstract
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
rate research
Read More
Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction. Inspired by the evolution of classical computation, an alternative paradigm merging the flexibility of digital quantum computation with the robustness of analog quantum simulation has emerged. This universal paradigm is known as digital-analog quantum computing. Here, we introduce an efficient digital-analog quantum algorithm to compute the quantum Fourier transform, a subroutine widely employed in several relevant quantum algorithms. We show that, under reasonable assumptions about noise models, the fidelity of the quantum Fourier transformation improves considerably using this approach when the number of qubits involved grows. This suggests that, in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid protocols combining digital and analog quantum computing could be a sensible approach to reach useful quantum supremacy.
In a growing number of applications, there is a need to digitize signals whose spectral characteristics are challenging for traditional Analog-to-Digital Converters (ADCs). Examples, among others, include systems where the ADC must acquire at once a very wide but sparsely and dynamically occupied bandwidth supporting diverse services, as well as systems where the signal of interest is subject to strong narrowband co-channel interference. In such scenarios, the resolution requirements can be prohibitively high. As an alternative, the recently proposed modulo-ADC architecture can in principle require dramatically fewer bits in the conversation to obtain the target fidelity, but requires that information about the spectrum be known and explicitly taken into account by the analog and digital processing in the converter, which is frequently impractical. To address this limitation, we develop a blind version of the architecture that requires no such knowledge in the converter, without sacrificing performance. In particular, it features an automatic modulo-level adjustment and a fully adaptive modulo unwrapping mechanism, allowing it to asymptotically match the characteristics of the unknown input signal. In addition to detailed analysis, simulations demonstrate the attractive performance characteristics in representative settings.
Digital quantum computing paradigm offers highly-desirable features such as universality, scalability, and quantum error correction. However, physical resource requirements to implement useful error-corrected quantum algorithms are prohibitive in the current era of NISQ devices. As an alternative path to performing universal quantum computation, within the NISQ era limitations, we propose to merge digital single-qubit operations with analog multi-qubit entangling blocks in an approach we call digital-analog quantum computing (DAQC). Along these lines, although the techniques may be extended to any resource, we propose to use unitaries generated by the ubiquitous Ising Hamiltonian for the analog entangling block and we prove its universal character. We construct explicit DAQC protocols for efficient simulations of arbitrary inhomogeneous Ising, two-body, and $M$-body spin Hamiltonian dynamics by means of single-qubit gates and a fixed homogeneous Ising Hamiltonian. Additionally, we compare a sequential approach where the interactions are switched on and off (stepwise~DAQC) with an always-on multi-qubit interaction interspersed by fast single-qubit pulses (banged DAQC). Finally, we perform numerical tests comparing purely digital schemes with DAQC protocols, showing a remarkably better performance of the latter. The proposed DAQC approach combines the robustness of analog quantum computing with the flexibility of digital methods.
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated by the systems underlying Hamiltonian. Inspired by this paradigm, we consider superconducting architectures and extend the cross-resonance effect, up to first order in perturbation theory, from a two-qubit interaction to an analog Hamiltonian acting on 1D chains and 2D square lattices which, in an appropriate reference frame, results in a purely two-local Hamiltonian. By augmenting the analog Hamiltonian dynamics with single-qubit gates we show how one may generate a larger variety of distinct analog Hamiltonians. We then synthesize unitary sequences, in which we toggle between the various analog Hamiltonians as needed, simulating the dynamics of Ising, $XY$, and Heisenberg spin models. Our dynamics simulations are Trotter error-free for the Ising and $XY$ models in 1D. We also show that the Trotter errors for 2D $XY$ and 1D Heisenberg chains are reduced, with respect to a digital decomposition, by a constant factor. In order to realize these important near-term speedups, we discuss the practical considerations needed to accurately characterize and calibrate our analog Hamiltonians for use in quantum simulations. We conclude with a discussion of how the Hamiltonian toggling techniques could be extended to derive new analog Hamiltonians which may be of use in more complex digital-analog quantum simulations for various models of interacting spins.
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due to the antisymmetric character of the fermionic wave function. Here, we introduce a digital-analog quantum algorithm to simulate a wide class of fermionic Hamiltonians including the paradigmatic Fermi-Hubbard model. These digital-analog methods allow quantum algorithms to run beyond digit
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
