Related papers: Quantum chaos and random matrix theoryfor fidelity…
We develop a new algorithm based on the time-dependent variational principle applied to matrix product states to efficiently simulate the real- and imaginary time dynamics for infinite one-dimensional quantum lattice systems. This…
We derive quantum kinetic equations for fermions in a homogeneous time-dependent background in presence of decohering collisions, by use of the Schwinger-Keldysh CTP-formalism. The quantum coherence (between particles and antiparticles) is…
With gate error rates in multiple technologies now below the threshold required for fault-tolerant quantum computation, the major remaining obstacle to useful quantum computation is scaling, a challenge greatly amplified by the huge…
In this work, we aim at augmenting the decisions output by quantum models with "error bars" that provide finite-sample coverage guarantees. Quantum models implement implicit probabilistic predictors that produce multiple random decisions…
In this paper we introduce a universal operator theoretic framework for quantum fault tolerance. This incorporates a top-down approach that implements a system-level criterion based on specification of the full system dynamics, applied at…
A system of quantum computing structures is introduced and proven capable of making emerge, on average, the orbits of classical bounded nonlinear maps on \mathbb{C} through the iterative action of path-dependent quantum gates. The effects…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
In this paper, we propose a scheme to eliminate the influence of noises on system dynamics, by means of a sequential unsharp measurements and unitary feedback operations. The unsharp measurements are carried out periodically during system…
Precision control of quantum systems is the driving force for both quantum technology and the probing of physics at the quantum and nano-scale. We propose an implementation independent method for in situ quantum control that leverages…
We study the time evolution of the quantum-classical correspondence (QCC) for the well known model of quantised perturbed cat maps on the torus in the very specific regime of semi-classically small perturbations. The quality of the QCC is…
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…
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…
We describe a simple randomized benchmarking protocol for quantum information processors and obtain a sequence of models for the observable fidelity decay as a function of a perturbative expansion of the errors. We are able to prove that…
Spontaneous symmetry breaking mechanism in quantum phase transitions manifests the existence of degenerate groundstates in broken symmetry phases. To detect such degenerate groundstates, we introduce a quantum fidelity as an overlap…
We speak of chaos in quantum systems if the statistical properties of the eigenvalue spectrum coincide with predictions of random-matrix theory. Chaos is a typical feature of atomic nuclei and other self-bound Fermi systems. How can the…
Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for…
Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing…
Quantum computing promises revolutionary advances in modeling materials and molecules. However, the up-to-date runtime estimates for utility-scale applications on certain quantum hardware systems are in the order of years rendering quantum…