Related papers: Comments on `Stable Quantum Computation of Unstabl…

Quantum computing holds potential for accelerating the simulation of fluid dynamics. However, hardware noise in the noisy intermediate-scale quantum era significantly distorts simulation accuracy. Although error magnitudes are frequently…

We have studied two complementary decoherence measures purity and fidelity for a generic diffusive noise in two different chaotic systems (the baker and the cat maps). For both quantities, we have found classical structures in quantum…

Using the decoherence formalism of Gell-Mann and Hartle, a quantum system is found which is the equivalent of the classical chaotic Duffing oscillator. The similarities and the differences from the classical oscillator are examined; in…

The vast majority of dynamical systems in classical physics are chaotic and exhibit the butterfly effect: a minute change in initial conditions can soon have exponentially large effects elsewhere. But this phenomenon is difficult to…

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of…

We argue that several claims of paper Phys. Rev. Lett 79, 1953 (1997), by Lu-Ming Duan and Guang-Can Guo, are questionable. In particular we stress that the environmental noise considered by the authors belongs to a very special class

For a large number of tasks, quantum computing demonstrates the potential for exponential acceleration over classical computing. In the NISQ era, variable-component subcircuits enable applications of quantum computing. To reduce the…

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…

The problem of Phase Estimation (or Amplitude Estimation) admits a quadratic quantum speedup. Wang, Higgott and Brierley [2019, Phys. Rev. Lett. 122 140504] have shown that there is a continuous trade-off between quantum speedup and circuit…

Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or…

Fault-tolerant quantum computations require alternating quantum and classical computations, where the classical computations prove vital in detecting and correcting errors in the quantum computation. Recently, interest in using these…

In this paper we criticize the attempt of Maccone [Phys. Rev. Lett. 103, 080401 (2009), arXiv:0802.0438] to solve the problem of the arrow of time.

Many quantum algorithms rely on the measurement of complex quantum amplitudes. Standard approaches to obtain the phase information, such as the Hadamard test, give rise to large overheads due to the need for global controlled-unitary…

Many body localization shows the robustness for external perturbations and time reversal symmetry on Time Crystal. This Time Crystal prolongs the coherence time, hence, it is used for quantum computers as qubits. Therefore, we established…

The emergence of the arrow of time in quantum many-body systems stems from the inherent tendency of Hamiltonian evolution to scramble quantum information and increase entanglement. While, in principle, one might counteract this temporal…

Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating the QC architecture. The…

The performance of a quantum information processor depends on the precise control of phases introduced into the system during quantum gate operations. As the number of operations increases with the complexity of a computation, the phases of…

Bosonic rotation codes, introduced here, are a broad class of bosonic error-correcting codes based on phase-space rotation symmetry. We present a universal quantum computing scheme applicable to a subset of this class--number-phase…

Lloyd et al. were first to demonstrate the promise of quantum algorithms for computing Betti numbers, a way to characterize topological features of data sets. Here, we propose, analyze, and optimize an improved quantum algorithm for…

Manipulating the state of a logical quantum bit usually comes at the expense of exposing it to decoherence. Fault-tolerant quantum computing tackles this problem by manipulating quantum information within a stable manifold of a larger…