Searcharxiv⌕ Search

arXiv subjects

A. Carlini

Publications and source records attributed to A. Carlini.

At least 19 recordsLinked to original sources
arXiv2017

Brachistochrone of Entanglement for Spin Chains

We analytically investigate the role of entanglement in time-optimal state evolution as an appli- cation of the quantum brachistochrone, a general method for obtaining the optimal time-dependent Hamiltonian for reaching a target quantum state. As a model, we treat two qubits indirectly cou- pled through an intermediate qubit that is directly controllable, which represents a typical situation in quantum information processing. We find the time-optimal unitary evolution law and quantify residual entanglement by the two-tangle between the indirectly coupled qubits, for all possible sets of initial pure quantum states of a tripartite system. The integrals of the motion of the brachistochrone are determined by fixing the minimal time at which the residual entanglement is maximized. Entan- glement plays a role for W and GHZ initial quantum states, and for the bi-separable initial state in which the indirectly coupled qubits have a nonzero value of the 2-tangle.

quant-ph↗
arXiv2012

Time-Optimal Transfer of Coherence

We provide exact analytical solutions for the problem of time-optimal transfer of coherence from one spin polarization to a three-fold coherence in a trilinear Ising chain with a fixed energy available and subject to local controls with a non negligible time cost. The time of transfer is optimal and consistent with a previous numerical result obtained assuming instantaneous local controls.

quant-ph↗
arXiv2012

Time-optimal Unitary Operations in Ising Chains II: Unequal Couplings and Fixed Fidelity

We analytically determine the minimal time and the optimal control laws required for the realization, up to an assigned fidelity and with a fixed energy available, of entangling quantum gates ($\mathrm{CNOT}$) between indirectly coupled qubits of a trilinear Ising chain. The control is coherent and open loop, and it is represented by a local and continuous magnetic field acting on the intermediate qubit. The time cost of this local quantum operation is not restricted to be zero. When the matching with the target gate is perfect (fidelity equal to one) we provide exact solutions for the case of equal Ising coupling. For the more general case when some error is tolerated (fidelity smaller than one) we give perturbative solutions for unequal couplings. Comparison with previous numerical solutions for the minimal time to generate the same gates with the same Ising Hamiltonian but with instantaneous local controls shows that the latter are not time-optimal.

quant-ph↗
arXiv2010

Time-optimal CNOT between indirectly coupled qubits in a linear Ising chain

We give analytical solutions for the time-optimal synthesis of entangling gates between indirectly coupled qubits 1 and 3 in a linear spin chain of three qubits subject to an Ising Hamiltonian interaction with equal coupling $J$ plus a local magnetic field acting on the intermediate qubit. The energy available is fixed, but we relax the standard assumption of instantaneous unitary operations acting on single qubits. The time required for performing an entangling gate which is equivalent, modulo local unitary operations, to the $\mathrm{CNOT}(1, 3)$ between the indirectly coupled qubits 1 and 3 is $T=\sqrt{3/2} J^{-1}$, i.e. faster than a previous estimate based on a similar Hamiltonian and the assumption of local unitaries with zero time cost. Furthermore, performing a simple Walsh-Hadamard rotation in the Hlibert space of qubit 3 shows that the time-optimal synthesis of the $\mathrm{CNOT}^{\pm}(1, 3)$ (which acts as the identity when the control qubit 1 is in the state $\ket{0}$, while if the control qubit is in the state $\ket{1}$ the target qubit 3 is flipped as $\ket{\pm}\rightarrow \ket{\mp}$) also requires the same time $T$.

quant-ph↗
arXiv2007

Quantum Brachistochrone for Mixed States

We present a general formalism based on the variational principle for finding the time-optimal quantum evolution of mixed states governed by a master equation, when the Hamiltonian and the Lindblad operators are subject to certain constraints. The problem reduces to solving first a fundamental equation (the {\it quantum brachistochrone}) for the Hamiltonian, which can be written down once the constraints are specified, and then solving the constraints and the master equation for the Lindblad and the density operators. As an application of our formalism, we study a simple one-qubit model where the optimal Lindblad operators control decoherence and can be simulated by a tunable coupling with an ancillary qubit. It is found that the evolution through mixed states can be more efficient than the unitary evolution between given pure states. We also discuss the mixed state evolution as a finite time unitary evolution of the system plus an environment followed by a single measurement. For the simplest choice of the constraints, the optimal duration time for the evolution is an exponentially decreasing function of the environment's degrees of freedom.

quant-ph↗
arXiv2005

Complementarity of Entanglement and Interference

A complementarity relation is shown between the visibility of interference and bipartite entanglement in a two qubit interferometric system when the parameters of the quantum operation change for a given input state. The entanglement measure is a decreasing function of the visibility of interference. The implications for quantum computation are briefly discussed.

quant-ph↗
arXiv2003

Geometrical Conditions for CPTP Maps and their Application to a Quantum Repeater and a State-dependent Quantum Cloning Machine

We address the problem of finding optimal CPTP (completely positive, trace preserving) maps between a set of binary pure states and another set of binary generic mixed state in a two dimensional space. The necessary and sufficient conditions for the existence of such CPTP maps can be discussed within a simple geometrical picture. We exploit this analysis to show the existence of an optimal quantum repeater which is superior to the known repeating strategies for a set of coherent states sent through a lossy quantum channel. We also show that the geometrical formulation of the CPTP mapping conditions can be a simpler method to derive a state-dependent quantum (anti) cloning machine than the study so far based on the explicit solution of several constraints imposed by unitarity in an extended Hilbert space.

quant-ph↗
arXiv2002

Quantum Entropy Bound by Information in Black Hole Spacetime

We show that the increase of the generalized entropy by a quantum process outside the horizon of a black hole is more than the Holevo bound of the classical information lost into the black hole and which could be obtained by further observations outside the horizon. In the optimal case, the prepared information can be completely retrieved.

quant-ph↗
arXiv2001

Quantum Template Matching

We consider the quantum analogue of the pattern matching problem, which consists of classifying a given unknown system according to certain predefined pattern classes. We address the problem of quantum template matching in which each pattern class ${\cal C}_i$ is represented by a known quantum state $\hat g_i$ called a template state, and our task is to find a template which optimally matches a given unknown quantum state $\hat f$. We set up a precise formulation of this problem in terms of the optimal strategy for an associated quantum Bayesian inference problem. We then investigate various examples of quantum template matching for qubit systems, considering the effect of allowing a finite number of copies of the input state $\hat f$. We compare quantum optimal matching strategies and semiclassical strategies and demonstrate an entanglement assisted enhancement of performance in the general quantum optimal strategy.

quant-ph↗
arXiv2001

Quantum Computers and Unstructured Search: Finding and Counting Items with an Arbitrarily Entangled Initial State

Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.

quant-ph↗
arXiv2000

Optimal phase estimation and square root measurement

We present an optimal strategy having finite outcomes for estimating a single parameter of the displacement operator on an arbitrary finite dimensional system using a finite number of identical samples. Assuming the uniform {\it a priori} distribution for the displacement parameter, an optimal strategy can be constructed by making the {\it square root measurement} based on uniformly distributed sample points. This type of measurement automatically ensures the global maximality of the figure of merit, that is, the so called average score or fidelity. Quantum circuit implementations for the optimal strategies are provided in the case of a two dimensional system.

quant-ph↗
arXiv2000

Generalized Second Law of Black Hole Thermodynamics and Quantum Information Theory

We propose a quantum version of a gedanken experiment which supports the generalized second law of black hole thermodynamics. A quantum measurement of particles in the region outside of the event horizon decreases the entropy of the outside matter due to the entanglement of the inside and outside particle states. This decrease is compensated, however, by the increase in the detector entropy. If the detector is conditionally dropped into the black hole depending on the experimental outcome, the decrease of the matter entropy is more than compensated by the increase of the black hole entropy via the increase of the black hole mass which is ultimately attributed to the work done by the measurement.

gr-qc↗
arXiv2000

Quantum Probabilistic Subroutines and Problems in Number Theory

We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for extracting the periodicity of a function, and their combined use in the counting algorithm originally introduced by Brassard et al. One of the main features of our quantum probabilistic algorithm is its full unitarity and reversibility, which would make its use possible as part of larger and more complicated networks in quantum computers. As an example of this we describe polynomial time algorithms for studying some important problems in number theory, such as the test of the primality of an integer, the so called 'prime number theorem' and Hardy and Littlewood's conjecture about the asymptotic number of representations of an even integer as a sum of two primes.

quant-ph↗
arXiv1999

Carmichael Numbers on a Quantum Computer

We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by Pomerance, Selfridge and Wagstaff concerning the asymptotic distribution of Carmichael numbers smaller than a given integer.

quant-ph↗
arXiv1996

The mass shell of the universe

The classical field equations of general relativity can be expressed as a single geodesic equation, describing the free fall of a point particle in superspace. Based on this formulation, a ``worldline'' quantization of gravity, analogous to the Feynman-Schwinger treatment of particle propagation, is proposed, and a hidden mass-shell parameter is identified. We consider the effective action for the supermetric, which would be induced at one loop. In certain minisuperspace models, we find that this effective action is stationary for vanishing cosmological constant.

gr-qc↗
arXiv1996

Time machines and the Principle of Self-Consistency as a consequence of the Principle of Stationary Action (II): the Cauchy problem for a self-interacting relativistic particle

We consider the action principle to derive the classical, relativistic motion of a self-interacting particle in a 4-D Lorentzian spacetime containing a wormhole and which allows the existence of closed time-like curves. In particular, we study the case of a pointlike particle subject to a `hard-sphere' self-interaction potential and which can traverse the wormhole an arbitrary number of times, and show that the only possible trajectories for which the classical action is stationary are those which are globally self-consistent. Generically, the multiplicity of these trajectories (defined as the number of self-consistent solutions to the equations of motion beginning with given Cauchy data) is finite, and it becomes infinite if certain constraints on the same initial data are satisfied. This confirms the previous conclusions (for a non-relativistic model) by Echeverria, Klinkhammer and Thorne that the Cauchy initial value problem in the presence of a wormhole `time machine' is classically `ill-posed' (far too many solutions). Our results further extend the recent claim by Novikov et al. that the `Principle of self-consistency' is a natural consequence of the `Principle of minimal action.'

gr-qc↗
arXiv1996

Time machines: the Principle of Self-Consistency as a consequence of the Principle of Minimal Action

We consider the action principle to derive the classical, non-relativistic motion of a self-interacting particle in a 4-D Lorentzian spacetime containing a wormhole and which allows the existence of closed time-like curves. For the case of a `hard-sphere' self-interaction potential we show that the only possible trajectories (for a particle with fixed initial and final positions and which traverses the wormhole once) minimizing the classical action are those which are globally self-consistent, and that the `Principle of self-consistency' (originally introduced by Novikov) is thus a natural consequence of the `Principle of minimal action.'

gr-qc↗