Related papers: Testing integrability with a single bit of quantum…
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 analyze the interplay of chaos, entanglement and decoherence in a system of qubits whose collective behaviour is that of a quantum kicked top. The dynamical entanglement between a single qubit and the rest can be calculated from the mean…
The DQC1 complexity class, or power of one qubit model, is examined as an open quantum system. We study the dynamics of a register of qubits carrying out a DQC1 algorithm and show that, for any algorithm in the complexity class, the…
Quantum computing is expected to provide exponential speedup in machine learning. However, optimizing the data loading process, commonly referred to as quantum data embedding, to maximize classification performance remains a critical…
The one-clean qubit model (or the DQC1 model) is a restricted model of quantum computing where only a single qubit of the initial state is pure and others are maximally mixed. Although the model is not universal, it can efficiently solve…
We present a mapping of potentially chaotic time-dependent quantum kicked systems to an equivalent effective time-independent scenario, whereby the system is rendered integrable. The time-evolution is factorized into an initial kick,…
Motivated in part by John Wheeler's assertion that the continuum nature of Hilbert Space conceals the `it-from-bit' information-theoretic character of the quantum wavefunction, a theory of quantum physics (Rational Quantum Mechanics - RaQM)…
We extract the information of a quantum motion and decode it into a certain orbit via a single measurable quantity. Such that a quantum chaotic system can be reconstructed as a chaotic attractor. Two configurations for reconstructing this…
One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…
Formation of chaos in the parametric dependent system of interacting oscillators for the both classical and quantum cases has been investigated. Domain in which classical motion is chaotic is defined. It has been shown that for certain…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…
We present a detailed numerical study of a chaotic classical system and its quantum counterpart. The system is a special case of a kicked rotor and for certain parameter values possesses cantori dividing chaotic regions of the classical…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
Identifying the boundary between classical and quantum computation is a central challenge in quantum information. In multi-qubit systems, entanglement and magic are the key resources underlying genuinely quantum behaviour. While…
We study an experimental setup in which a quantum probe, provided by a quasi-monomode guided atom laser, interacts with a static localized attractive potential whose characteristic parameters are tunable. In this system, classical mechanics…
A path for efficient classical simulation of the DQC1 circuit that estimates the trace of an implementable unitary under the zero discord condition [Phys. Rev. Lett. 105, 190502 (2010)] is presented. This result reinforces the status of…
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the…
In this thesis, I look at the role of quantum entanglement in mixed-state quantum computation. The model we consider is the DQC1 or `power of one qubit' model. I show that there is minimal bipartite entanglement in a typical instance of the…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
The ultimate goal of the classicality programme is to quantify the amount of quantumness of certain processes. Here, classicality is studied for a restricted type of process: quantum information processing (QIP). Under special conditions,…