Searcharxiv⌕ Search

arXiv subjects

Andrzej Grudka

Publications and source records attributed to Andrzej Grudka.

At least 19 recordsLinked to original sources

Thermal Operations in general are not memoryless

So-called Thermal Operations seem to describe the most fundamental and reasonable set of operations allowable for state transformations at an ambient inverse temperature $β$. However, a priori, they require experimentalists to manipulate very complex environments and have control over their internal degrees of freedom. For this reason, the community has been working on creating more experimentally-friendly operations. In [Perry, et al., Phys. Rev. X 8, 041049], it was shown that for states diagonal in the energy basis, Thermal Operations can be performed by so-called Coarse Operations, which need just one auxiliary qubit but are otherwise Markovian and classical in spirit. In this work, by providing an explicit counterexample, we show that this one qubit of memory is necessary. We also provide almost full characterization (i.e., full, but with one intriguing exception that remains open) of possible transitions that do not require memory in the case where the system is a qubit. We do this by analyzing arbitrary control sequences comprising level energy changes and partial thermalizations in each step.

quant-ph↗

Unitary Realizations of Synchronizing Automata in Quantum Systems

We introduce a quantum analogue of a classical synchronizing automaton. In classical case the state of a system evolves according to a set of rules forming an alphabet, and sequences of these rules, called words, govern its evolution. Certain special words, known as synchronizing words, drive the automaton into a predetermined state regardless of its initial configuration. Although such an apparently irreversible process seems incompatible with the unitarity of quantum mechanics, we present a resetting protocol based on quantum synchronizing words by incorporating auxiliary qubits whose states encode the rules of the automaton's alphabet. These qubits interact with the quantum automaton, whose state is encoded in a qudit, via a global unitary operation. When the qubit register is initially prepared in a state corresponding to a synchronizing word, the automaton evolves into a predetermined pure state independent of its initial state, while the qubit register is transformed into a complex, often entangled, state that encodes information about the automaton's original configuration. The resulting entanglement depends on both the rule set and the automaton's initial state, and we show how specific entangled states can be generated within this framework.

quant-ph↗

Rabi transport and the other finite-size effects in one-dimensional discrete-time topological quantum walk

This paper investigates Rabi transport and finite-size effects in one-dimensional discrete-time topological quantum walks. We demonstrate the emergence of localized states at boundaries between topologically distinct phases and analyze how finite system sizes influence quantum walk dynamics. For finite lattices, we show that topology induces localized and bilocalized states, leading to Rabi-like transport as a result of degeneracy breaking due to finite-size effects. The study bridges the gap between topological protection and size-dependent dynamics, revealing transitions from ballistic motion to localized or oscillatory behavior based on the system's topological properties. Analytical and numerical methods are employed to explore the spectra and dynamics of quantum walks, highlighting the robustness of Rabi transport against disorder. The findings provide insights into controlled quantum transport and potential applications in quantum information processing.

quant-ph↗

Sending absolutely maximally entangled states through noisy quantum channels

Absolutely maximally entangled states are quantum states that exhibit maximal entanglement across any bipartition, making them valuable for applications. This study investigates the behavior of qubit AME states under the influence of noisy quantum channels. Our results demonstrate that for certain channels, such as the depolarizing channel, the entanglement properties remain invariant under local unitary transformations and are independent of the choice of qubits in each subset. However, for channels like the dephasing channel, the entanglement behavior can vary depending on the specific AME state and the choice of qubits, revealing a symmetry-breaking effect. These findings highlight the nuanced relationship between AME states and noise, providing insights into their robustness and potential applications in noisy quantum systems.

quant-ph↗

A quantum oscillator interacting with a classical oscillator

We study a quantum oscillator interacting and back-reacting on a classical oscillator. This can be done consistently provided the quantum system decoheres, while the backreaction has a stochastic component which causes the classical system to undergo diffusion. Nonetheless the state of the quantum oscillator can remain pure conditioned on the trajectory of the classical oscillator. We solve the system using the classical-quantum path integral formulation, and investigate slow moving regimes of either the classical or quantum oscillator. Lastly, we study the correlators of this classicalquantum setup. We are able to identify the free correlators of the theory and compute the full partition function perturbatively up to second order. This serves as a toy model for a number of other systems in which one system can be treated as effectively classical, such as a scalar quantum field interacting with another field undergoing decoherence, or a system emitting radiation, one of which is treated classically.

quant-ph↗

Quantum Resetting Protocols Based on Synchronizing Words

Resetting a system's state plays a fundamental role in physics, engineering, computer science, and many other fields. Here we focus on a method originally proposed in automata theory. The state of an automaton evolves according to a set of rules. These rules form an alphabet, and one can apply these rules one after another. Such a sequence of rules is known as a word. Some particular words, known as synchronizing words, enable a system to evolve into a predetermined state regardless of its initial configuration. This process, which is inherently irreversible, appears at first glance to be incompatible with the unitarity of quantum mechanics. Unitary evolution preserves information, hence forbids such classical resetting to a predetermined state. In this work, we introduce a novel resetting protocol based on quantum-synchronizing words by incorporating auxiliary qubits whose states encode rules of the automaton's alphabet. We further propose a quantum circuit that realizes this protocol and can be implemented on a quantum computer. Additionally, we establish a connection between this approach and Kraus channels, showing that quantum synchronizing words can be achieved without explicit reference to the states of ancillary qubits. Our results bridge classical and quantum notions of synchronizing words, shedding light on the interplay between quantum information processing and non-unitary dynamics.

quant-ph↗

Quantum Synchronizing Words: Resetting and Preparing Qutrit States

Synchronizing words in classical automata theory provide a mechanism to reset any state of a deterministic automaton to a specific target state via a carefully chosen finite sequence of transition rules. In this work, we extend the concept of synchronizing words to quantum information theory. Specifically, we show that with only two quantum channels, it is possible to bring an arbitrary qutrit state close to a designated target state. Furthermore, we demonstrate that following this reset, any pure real qutrit state can be closely approximated using the same two channels. These findings establish a quantum analogue of synchronizing words, highlighting their potential applications in constructing minimal sets of universal quantum gates capable of both resetting and preparing arbitrary states.

quant-ph↗

Renormalisation of postquantum-classical gravity

One of the obstacles to reconciling quantum theory with general relativity, is constructing a theory which is both consistent with observation, and and gives finite answers at high energy, so that the theory holds at arbitrarily short distances. Quantum field theory achieves this through the process of renormalisation, but famously, perturbative quantum gravity fails to be renormalisable, even without coupling to matter. Recently, an alternative to quantum gravity has been proposed, in which the geometry of spacetime is taken to be classical rather than quantum, while still being coupled to quantum matter fields [1, 2]. This can be done consistently, provided the dynamics is fundamentally stochastic. Here, we find that the pure gravity theory is formally renormalisable. We do so via the path integral formulation by relating the classical-quantum action to that of quadratic gravity which is renormalisable. Because the action induces stochastic dynamics of space-time, rather than deterministic evolution of a quantum field, the classical-quantum theory is free of tachyons and negative norm ghosts. The key remaining question is whether the renormalisation prescription retains completely positive (CP) dynamics. This consideration appears to single out the scale invariant and asymptotically free theory. We give further evidence that the theory is CP, by showing that the two-point function of the scalar mode is positive. To support the use of precision accelerometers in testing the quantum nature of spacetime, we also compute the power spectral density of the acceleration. The results presented here have a number of implications for inflation, CMB data, and experiments to test the quantum nature of spacetime. They may also provide a way to compute probabilities in the regime of quantum gravity where spacetime can be treated as effectively classical.

hep-th↗

Superluminal observers do not explain quantum superpositions

The quantum description of reality is quite different from the classical one. Understanding this difference at a fundamental level is still an interesting topic. Recently, Dragan and Ekert [New J. Phys. 22 (2020) 033038] postulated that considering so-called superluminal observers can be useful in this context. In particular, they claim that the full mathematical structure of the generalized Lorentz transformation may imply the emergence of multiple quantum mechanical trajectories. On the contrary, here we show that the generalized Lorentz transformation, when used in a consistent way, does not provide any correspondence between the classical concept of a definite path and the multiple paths of quantum mechanics.

quant-ph↗

Exposing Hypersensitivity in Quantum Chaotic Dynamics

We demonstrate that the unitary dynamics of a multi-qubit system can display hypersensitivity to initial state perturbation. This contradicts the common belief that the classical approach based on the exponential divergence of initially neighboring trajectories cannot be applied to identify chaos in quantum systems. To observe hypersensitivity we use quantum state-metric, introduced by Girolami and Anza in [Phys. Rev. Lett. 126 (2021) 170502], which can be interpreted as a quantum Hamming distance. As an example of a quantum system, we take the multi-qubit implementation of the quantum kicked top, a paradigmatic system known to exhibit quantum chaotic behavior. Our findings confirm that the observed hypersensitivity corresponds to commonly used signatures of quantum chaos. Furthermore, we demonstrate that the proposed metric can detect quantum chaos in the same regime and under analogous initial conditions as in the corresponding classical case.

quant-ph↗

Relative homotopy approach to topological phases in quantum walks

Discrete-time quantum walks (DTQWs) provide a convenient platform for a realisation of many topological phases in noninteracting systems. They often offer more possibilities than systems with a static Hamiltonian. Nevertheless, researchers are still looking for DTQW symmetries protecting topological phases and for definitions of appropriate topological invariants. Although majority of DTQW studies on this topic focus on the so called split-step quantum walk, two distinct topological phases can be observed in more basic models. Here we infer topological properties of the basic DTQWs directly from the mapping of the Brillouin zone to the Bloch Hamiltonian. We show that for translation symmetric systems they can be characterized by a homotopy relative to special points. We also propose a new topological invariant corresponding to this concept. This invariant indicates the number of edge states at the interface between two distinct phases.

quant-ph↗

Complementarity in quantum walks

We study discrete-time quantum walks on $d$-cycles with a position and coin-dependent phase-shift. Such a model simulates a dynamics of a quantum particle moving on a ring with an artificial gauge field. In our case the amplitude of the phase-shift is governed by a single discrete parameter $q$. We solve the model analytically and observe that for prime $d$ there exists a strong complementarity property between the eigenvectors of two quantum walk evolution operators that act in the $2d$-dimensional Hilbert space. Namely, if $d$ is prime the corresponding eigenvectors of the evolution operators obey $|\langle v_q|v'_{q'} \rangle| \leq 1/\sqrt{d}$ for $q\neq q'$ and for all $|v_q\rangle$ and $|v'_{q'}\rangle$. We also discuss dynamical consequences of this complementarity. Finally, we show that the complementarity is still present in the continuous version of this model, which corresponds to a one-dimensional Dirac particle.

quant-ph↗

Galilean invariance without superluminal particles

Recently Dragan and Ekert [New. J. Phys 22, 033038, 2020] presented arguments that probabilistic dynamics inherent in the realm of quantum physics is related to the propagation of superluminal particles. Moreover they argue that existence of such particles is a natural consequence of the principle of relativity. We show that the proposed extension of Lorentz transformation can be interpreted in natural way without invoking superluminal phenomena.

quant-ph↗

On Quantum Semipermeable Barriers: Investigating Maxwell's Demon Toolbox

We study quantum Maxwell's demon in a discrete space-time setup. We consider a collection of particles hopping on a one-dimensional chain and a semipermeable barrier that allows the particles to hop in only one direction. Our main result is a formulation of a local unitary dynamics describing the action of this barrier. Such dynamics utilises an auxiliary system $\mathcal{A}$ and we study how properties of $\mathcal{A}$ influence the behaviour of particles. An immediate consequence of unitarity is the fact that particles cannot be trapped on one side of the barrier forever, unless $\mathcal{A}$ is infinite. In addition, coherent superpositions and quantum correlations are affected once particles enter the confinement region. Finally, we show that initial superposition of $\mathcal{A}$ allows the barrier to act as a beam splitter.

quant-ph↗

Quantum error correction codes and absolutely maximally entangled states

For every stabiliser $N$-qudit absolutely maximally entangled state, we present a method for determining the stabiliser generators and logical operators of a corresponding quantum error correction code. These codes encode $k$ qudits into $N-k$ qudits, with $k\leq \left \lfloor{N/2} \right \rfloor$, where the local dimension $d$ is prime. We use these methods to analyse the concatenation of such quantum codes and link this procedure to entanglement swapping. Using our techniques, we investigate the spread of quantum information on a tensor network code formerly used as a toy model for the AdS/CFT correspondence. In this network, we show how corrections arise to the Ryu-Takayanagi formula in the case of entangled input state, and that the bound on the entanglement entropy of the boundary state is saturated for absolutely maximally entangled input states.

quant-ph↗

Generalized XOR non-locality games with graph description on a square lattice

We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the games have classical values computable in polynomial time for $d=2$ measurement outcomes. By representing games in their graph form, for arbitrary $d$ and underlying surface we provide their classification into equivalence classes with respect to relabeling of measurement outcomes, for a selected set of permutations which define the winning conditions. A case study of games with periodic boundary conditions is presented in order to verify their impact on classical and quantum values of the family of games. It suggests that quantum values suffer independently from presence of different winning conditions that can be imposed due to periodicity, as long as no local restrictions are in place.

quant-ph↗

Closed timelike curves and the second law of thermodynamics

One out of many emerging implications from solutions of Einstein's general relativity equations are closed timelike curves (CTCs), which are trajectories through spacetime that allow for time travel to the past without exceeding the speed of light. Two main quantum models of computation with the use of CTCs were introduced by Deutsch (D-CTC) and by Bennett and Schumacher (P-CTC). Unlike the classical theory in which CTCs lead to logical paradoxes, the quantum D-CTC model provides a solution that is logically consistent due to the self-consistency condition imposed on the evolving system, whereas the quantum P-CTC model chooses such solution through post-selection. Both models are non-equivalent and imply nonstandard phenomena in the field of quantum computation and quantum mechanics. In this work we study the implications of these two models on the second law of thermodynamics - the fundamental principle which states that in an isolated system the entropy never decreases. In particular, we construct CTC-based quantum circuits which lead to decrease of entropy.

gr-qc↗

Amplifying the randomness of weak sources correlated with devices

The problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this work, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition for devices, namely that any string of SV source bits remains weakly random conditioned upon any other bit string from the same SV source and the outputs obtained when this further string is input into the devices. Assuming this condition, we show that a quantum device using a~singlet state to violate the chained Bell inequalities leads to full randomness in the asymptotic scenario of a large number of settings, for a restricted set of SV sources (with $0 \leq \varepsilon < (2^{(1/12)} - 1)/(2(2^{(1/12)} + 1)) \approx 0.0144$). We also study a device-independent protocol that allows for correlations between the sequence of boxes used in the protocol and the SV source bits used to choose the particular box from whose output the randomness is obtained. Assuming the SV-like condition for devices, we show that the honest parties can achieve amplification of the weak source, for the parameter range $0 \leq \varepsilon<0.0132$, against a class of attacks given as a mixture of product box sequences, made of extremal no-signaling boxes, with additional symmetry conditions. Composable security proof against this class of attacks is provided.

quant-ph↗