Search

State conversion is a fundamental task in quantum information processing. Quantum resource theories allow to analyze and bound conversions that use restricted sets of operations. In the context of continuous-variable systems, state conversions restricted to Gaussian operations are crucial for both fundamental and practical reasons -- particularly in state preparation and quantum computing with bosonic codes. However, previous analysis did not consider the relevant case of approximate state conversion. In this work, we introduce a framework for assessing approximate Gaussian state conversion by extending the stellar rank to the approximate stellar rank, which serves as an operational measure of non-Gaussianity. We derive bounds for Gaussian state conversion under both approximate and probabilistic conditions, yielding new no-go results for non-Gaussian state preparation and enabling a reliable assessment of the performance of generic Gaussian conversion protocols.

Although the similarity between non-stabilizer states -- also known as magic states -- in discrete-variable systems and non-Gaussian states in continuous-variable systems has widely been recognized, the precise connections between these two notions have still been unclear. We establish a fundamental link between these two quantum resources via the Gottesman-Kitaev-Preskill (GKP) encoding. We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure we introduce, which matches the negativity of the discrete Wigner function for odd dimensions. We also provide a continuous-variable representation of the stabilizer R\'enyi entropy -- a recent proposal for a magic measure for multi-qubit states. With this in hand, we give a classical simulation algorithm with runtime scaling with the resource contents, quantified by our magic measures. We also employ our results to prove that implementing a multi-qubit logical non-Clifford operation in the GKP code subspace requires a non-Gaussian operation even at the limit of perfect encoding, despite the fact that the ideal GKP states already come with a large amount of non-Gaussianity.

Data show that the presence of women in quantum science is affected by a number of detriments and their percentage decreases even further for higher positions. Beyond data, from our shared personal experiences as female tenured quantum physics professors, we believe that the current model of scientific leadership, funding, and authority fails to represent many of us. It is time for a real change that calls for a different kind of force and for the participation of everyone. Women for quantum calls for a joint effort and aims with this initiative to contribute to such a transformation.

We propose efficient algorithms for classically simulating Gaussian unitaries and measurements applied to non-Gaussian initial states. The constructions are based on decomposing the non-Gaussian states into linear combinations of Gaussian states. We use an extension of the covariance matrix formalism to efficiently track relative phases in the superpositions of Gaussian states. We get an exact simulation algorithm which cost scales quadratically with the number of Gaussian states required to represent the initial state and an approximate simulation algorithm which cost scales linearly with the $l_1$ norm of the coefficients associated with the superposition. We define measures of non-Gaussianty quantifying this simulation cost, which we call the Gaussian rank and the Gaussian extent. From the perspective of quantum resource theories, we investigate the properties of this type of non-Gaussianity measure and compute optimal decomposition for states relevant to continuous-variable quantum computing.

These are the lecture notes of the master's course "Quantum Computing", taught at Chalmers University of Technology every fall since 2020, with participation of students from RWTH Aachen and Delft University of Technology. The aim of this course is to provide a theoretical overview of quantum computing, excluding specific hardware implementations. Topics covered in these notes include quantum algorithms (such as Grover's algorithm, the quantum Fourier transform, phase estimation, and Shor's algorithm), variational quantum algorithms that utilise an interplay between classical and quantum computers [such as the variational quantum eigensolver (VQE) and the quantum approximate optimisation algorithm (QAOA), among others], quantum error correction, various versions of quantum computing (such as measurement-based quantum computation, adiabatic quantum computation, and the continuous-variable approach to quantum information), the intersection of quantum computing and machine learning, and quantum complexity theory. Lectures on these topics are compiled into 12 chapters, most of which contain a few suggested exercises at the end, and interspersed with four tutorials, which provide practical exercises as well as further details. At Chalmers, the course is taught in seven weeks, with three two-hour lectures or tutorials per week. It is recommended that the students taking the course have some previous experience with quantum physics, but not strictly necessary., Comment: Lecture notes from an MSc overview course on quantum computing. 177 pages, 58 figures, 12 chapters, 4 tutorials

Continuous-variable bosonic systems stand as prominent candidates for implementing quantum computational tasks. While various necessary criteria have been established to assess their resourcefulness, sufficient conditions have remained elusive. We address this gap by focusing on promoting circuits that are otherwise simulatable to computational universality. The class of simulatable, albeit non-Gaussian, circuits that we consider is composed of Gottesman-Kitaev-Preskill (GKP) states, Gaussian operations, and homodyne measurements. Based on these circuits, we first introduce a general framework for mapping a continuous-variable state into a qubit state. Subsequently, we cast existing maps into this framework, including the modular and stabilizer subsystem decompositions. By combining these findings with established results for discrete-variable systems, we formulate a sufficient condition for achieving universal quantum computation. Leveraging this, we evaluate the computational resourcefulness of a variety of states, including Gaussian states, finite-squeezing GKP states, and cat states. Furthermore, our framework reveals that both the stabilizer subsystem decomposition and the modular subsystem decomposition (of position-symmetric states) can be constructed in terms of simulatable operations. This establishes a robust resource-theoretical foundation for employing these techniques to evaluate the logical content of a generic continuous-variable state, which can be of independent interest., Comment: 31 pages, 14 figures

The Quantum Approximate Optimization Algorithm (QAOA) -- one of the leading algorithms for applications on intermediate-scale quantum processors -- is designed to provide approximate solutions to combinatorial optimization problems with shallow quantum circuits. Here, we study QAOA implementations with cat qubits, using coherent states with opposite amplitudes. The dominant noise mechanism, i.e., photon losses, results in $Z$-biased noise with this encoding. We consider in particular an implementation with Kerr resonators. We numerically simulate solving MaxCut problems using QAOA with cat qubits by simulating the required gates sequence acting on the Kerr non-linear resonators, and compare to the case of standard qubits, encoded in ideal two-level systems, in the presence of single-photon loss. Our results show that running QAOA with cat qubits increases the approximation ratio for random instances of MaxCut with respect to qubits encoded into two-level systems., Comment: 15 pages, 13 figures

In the field of fault-tolerant quantum computing, continuous-variable systems can be utilized to protect quantum information from noise through the use of bosonic codes. These codes map qubit-type quantum information onto the larger bosonic Hilbert space, and can be divided into two main categories: translational-symmetric codes, such as Gottesman-Kitaev-Preskill (GKP) codes, and rotational-symmetric codes, including cat and binomial codes. The relationship between these families of codes has not yet been fully understood. We present an iterative protocol for converting between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit - using only Gaussian operations. This conversion demonstrates the potential for universality of binomial states for all-Gaussian quantum computation and provides a new method for the heraladed preparation of GKP states. Through numerical simulation, we obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%, after only two steps of our iterative protocol, though higher fidelities can be achieved with additional iterations at the cost of lower success probabilities., Comment: 10 pages

Virtual distillation has been proposed as an error mitigation protocol for estimating the expectation values of observables in quantum algorithms. It proceeds by creating a cyclic permutation of $M$ noisy copies of a quantum state using a sequence of controlled-swap gates. If the noise does not shift the dominant eigenvector of the density operator away from the ideal state, then the error in expectation-value estimation can be exponentially reduced with $M$. In practice, subsequent error mitigation techniques are required to suppress the effect of noise in the cyclic permutation circuit itself, leading to increased experimental complexity. Here, we perform a careful analysis of the effect of uncorrelated, identical noise in the cyclic permutation circuit and find that the estimation of expectation value of observables are robust against dephasing noise. We support the analytical result with numerical simulations and find that $67\%$ of errors are reduced for $M=2$, with physical dephasing error probabilities as high as $10\%$. Our results imply that a broad class of quantum algorithms can be implemented with higher accuracy in the near-term with qubit platforms where non-dephasing errors are suppressed, such as superconducting bosonic qubits and Rydberg atoms., Comment: 14 pages, 5 figures

We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states, Gaussian operations - including all rational symplectic operations and all real displacements -, and homodyne measurement. We prove that such architecture is classically efficiently simulatable, by explicitly providing an algorithm to calculate the probability density function of the measurement outcomes of the computation. We also provide a method to sample when the circuits contain conditional operations. This result is based on an extension of the celebrated Gottesman-Knill theorem, via introducing proper stabilizer operators for the code at hand. We conclude that the resource enabling quantum advantage in the universal computational model considered by B.Q. Baragiola et al. [Phys. Rev. Lett. 123, 200502 (2019)], composed of a subset of the elements given above augmented with a provision of vacuum states, is indeed the vacuum state., Comment: 21 pages, 6 figures

In the context of quantum technologies over continuous variables, Gaussian states and operations are typically regarded as freely available, as they are relatively easily accessible experimentally. In contrast, the generation of non-Gaussian states, as well as the implementation of non-Gaussian operations, pose significant challenges. This divide has motivated the introduction of resource theories of non-Gaussianity. As for any resource theory, it is of practical relevance to identify free conversion protocols between resources, namely Gaussian conversion protocols between non-Gaussian states. Via systematic numerical investigations, we address the approximate conversion between experimentally relevant single-mode non-Gaussian states via arbitrary deterministic one-to-one mode Gaussian maps. First, we show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. Then we consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations. The numerical tools that we develop also allow to devise conversions of trisqueezed into cubic-phase states beyond previously reported performances. Finally, we identify various other conversions which instead are not viable.

We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems such as the Gottesman-Knill theorem can be employed to assess the simulatability. We first develop a method to evaluate the probability density function corresponding to measuring a single GKP state in the position basis following arbitrary squeezing and a large set of rotations. This method involves evaluating a transformed Jacobi theta function using techniques from analytic number theory. We then use this result to identify two large classes of multimode circuits which are classically efficiently simulatable and are not contained by the GKP encoded Clifford group. Our results extend the set of circuits previously known to be classically efficiently simulatable., Comment: 31 pages, 8 figures - published version

Hosting non-classical states of light in three-dimensional microwave cavities has emerged as a promising paradigm for continuous-variable quantum information processing. Here we experimentally demonstrate high-fidelity generation of a range of Wigner-negative states useful for quantum computation, such as Schr\"{o}dinger-cat states, binomial states, Gottesman-Kitaev-Preskill (GKP) states, as well as cubic phase states. The latter states have been long sought after in quantum optics and were never achieved experimentally before. To do so, we use a sequence of interleaved selective number-dependent arbitrary phase (SNAP) gates and displacements. We optimize the state preparation in two steps. First we use a gradient-descent algorithm to optimize the parameters of the SNAP and displacement gates. Then we optimize the envelope of the pulses implementing the SNAP gates. Our results show that this way of creating highly non-classical states in a harmonic oscillator is robust to fluctuations of the system parameters such as the qubit frequency and the dispersive shift.

Quantum resource theories are a powerful framework to characterize and quantify relevant quantum phenomena and identify processes that optimize their use for different tasks. Here, we define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. In contrast to previous literature, our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation. Particularly, we use the Gottesman-Kitaev-Preskill code to represent multi-qubit states and consider the resource theory for the Wigner negativity. Our techniques are useful to find resource lower bounds for different applications as state conversion and general unitary synthesis, in which measurements, auxiliary states, and classical feed-forward are allowed. The analytical expression of our magic measure allows us to extend current analysis limited to small dimensions, easily addressing systems of up to 12 qubits.

Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing. A broad class of bosonic codes, namely rotation-symmetric codes, can be characterized by their phase-space rotation symmetry. However, their performance has been examined to date only within an idealistic noise model. Here, we further analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. To this end, we numerically compute the average gate fidelity, including measurement errors into the noise model of the data qubit. Focusing on physical measurement models, we assess the performance of heterodyne and adaptive homodyne detection in comparison to the previously studied canonical phase measurement. This setting allows us to shed light on the role of different currently available measurement schemes when decoding the encoded information. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential. In addition, we perform a detailed analysis of Gottesman-Kitaev-Preskill (GKP) codes using a similar error-correction circuit that allows us to analyze the effect of realistic measurement models on different codes. In comparison to RSB codes, we find for GKP codes an even greater reduction in performance together with a vulnerability to photon-number dephasing. Our results show that highly efficient measurement protocols constitute a crucial building block towards error-corrected quantum information processing with bosonic continuous-variable systems., Comment: revised & accepted version

We present a method that integrates any quantum algorithm capable of finding solutions to integer linear programs into the Branch-and-Price algorithm, which is regularly used to solve large-scale integer linear programs with a specific structure. The role of the quantum algorithm is to find integer solutions to subproblems appearing in Branch-and-Price. Obtaining optimal or near-optimal integer solutions to these subproblems can increase the quality of solutions and reduce the depth and branching factor of the Branch-and-Price algorithm and hence reduce the overall running time. We investigate the viability of the approach by considering the Tail Assignment problem and the Quantum Approximate Optimization Algorithm (QAOA). Here, the master problem is the optimization problem Set Partitioning or its decision version Exact Cover and can be expressed as finding the ground state of an Ising spin glass Hamiltonian. For Exact Cover, our numerical results indicate that the required algorithm depth decreases with the number of feasible solutions for a given success probability of finding a feasible solution. For Set Partitioning, on the other hand, we find that for a given success probability of finding the optimal solution, the required algorithm depth can increase with the number of feasible solutions if the Hamiltonian is balanced poorly, which in the worst case is exponential in the problem size. We therefore address the importance of properly balancing the objective and constraint parts of the Hamiltonian. We empirically find that the approach is viable with QAOA if polynomial algorithm depth can be realized on quantum devices., Comment: 20 pages, 7 figures

We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits., Comment: 8+6 pages, 3 figures. Comments welcome!

Universal quantum computing with continuous variables requires non-Gaussian resources, in addition to a Gaussian set of operations. A known resource enabling universal quantum computation is the cubic phase state, a non-Gaussian state whose experimental implementation has so far remained elusive. In this paper, we introduce two Gaussian conversion protocols that allow for the conversion of a non-Gaussian state that has been achieved experimentally, namely the trisqueezed state [Sandbo Changet al., Phys. Rev. X10, 011011 (2020)],to a cubic phase state. The first protocol is deterministic and it involves active (in-line) squeezing, achieving large fidelities that saturate the bound for deterministic Gaussian protocols. The second protocol is probabilistic and it involves an auxiliary squeezed state, thus removing the necessity of in-line squeezing but still maintaining significant success probabilities and fidelities even larger than for the deterministic case. The success of these protocols provides strong evidence for using trisqueezed states as resources for universal quantum computation.

Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, establishing such a boundary is akin to pinpointing the resources for quantum advantage; from the technological point of view, it is essential for the design of non-trivial quantum computing architectures. Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures, including those based on continuous variables (CVs). However, it is not a sufficient resource, and it is an open question under which conditions CV circuits displaying Wigner negativity offer the potential for quantum advantage. In this work we identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable, although they are not recognized as such by previously available theorems. These families of circuits employ bosonic codes based on either translational or rotational symmetries (e.g., Gottesman-Kitaev-Preskill or cat codes), and can include both Gaussian and non-Gaussian gates and measurements. Crucially, within these encodings, the computational basis states are described by intrinsically negative Wigner functions, even though they are stabilizer states if considered as codewords belonging to a finite-dimensional Hilbert space. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes., Comment: (v1) 21 pages, 8 figures, 3 tables. (v2) 22 pages, 9 figures, 3 tables

We provide an explicit construction of a universal gate set for continuous-variable quantum computation with microwave circuits. Such a universal set has been first proposed in quantum-optical setups, but its experimental implementation has remained elusive in that domain due to the difficulties in engineering strong nonlinearities. Here, we show that a realistic three-wave mixing microwave architecture based on the SNAIL [Frattini et al., Appl. Phys. Lett. 110, 222603 (2017)] allows us to overcome this difficulty. As an application, we show that this architecture allows for the generation of a cubic phase state with an experimentally feasible procedure. This work highlights a practical advantage of microwave circuits with respect to optical systems for the purpose of engineering non-Gaussian states, and opens the quest for continuous-variable algorithms based on few repetitions of elementary gates from the continuous-variable universal set., Comment: accepted version

Present-day, noisy, small or intermediate-scale quantum processors---although far from fault-tolerant---support the execution of heuristic quantum algorithms, which might enable a quantum advantage, for example, when applied to combinatorial optimization problems. On small-scale quantum processors, validations of such algorithms serve as important technology demonstrators. We implement the quantum approximate optimization algorithm (QAOA) on our hardware platform, consisting of two superconducting transmon qubits and one parametrically modulated coupler. We solve small instances of the NP-complete exact-cover problem, with 96.6% success probability, by iterating the algorithm up to level two., Comment: 9 pages, 7 figures

Airlines today are faced with a number of large scale scheduling problems. One such problem is the tail assignment problem, which is the task of assigning individual aircraft to a given set of flights, minimizing the overall cost. Each aircraft is identified by the registration number on its tail fin. In this article, we simulate the Quantum Approximate Optimization Algorithm (QAOA) applied to instances of this problem derived from real world data. The QAOA is a variational hybrid quantum-classical algorithm recently introduced and likely to run on near-term quantum devices. The instances are reduced to fit on quantum devices with 8, 15 and 25 qubits. The reduction procedure leaves only one feasible solution per instance, which allows us to map the tail assignment problem onto the Exact Cover problem. We find that repeated runs of the QAOA identify the feasible solution with close to unit probability for all instances. Furthermore, we observe patterns in the variational parameters such that an interpolation strategy can be employed which significantly simplifies the classical optimization part of the QAOA. Finally, we empirically find a relation between the connectivity of the problem graph and the single-shot success probability of the algorithm., Comment: 11 pages, 10 figures

We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding to define a secret sharing protocol and we prove that they are satisfied by almost any interferometer. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently with a Gaussian unitary using a number of single-mode squeezers that is at most twice the number of modes of the secret, regardless of the number of players. We benchmark the quality of the reconstructed state by computing the fidelity with the secret state as a function of the input squeezing., Comment: Updated figure 1, added figure 2, closer to published version

Continuous-Variable (CV) devices are a promising platform for demonstrating large-scale quantum information protocols. In this framework, we define a general quantum computational model based on a CV hardware. It consists of vacuum input states, a finite set of gates - including non-Gaussian elements - and homodyne detection. We show that this model incorporates encodings sufficient for probabilistic fault-tolerant universal quantum computing. Furthermore, we show that this model can be adapted to yield sampling problems that cannot be simulated efficiently with a classical computer, unless the polynomial hierarchy collapses. This allows us to provide a simple paradigm for short-term experiments to probe quantum advantage relying on Gaussian states, homodyne detection and some form of non-Gaussian evolution. We finally address the recently introduced model of Instantaneous Quantum Computing in CV, and prove that the hardness statement is robust with respect to some experimentally relevant simplifications in the definition of that model., Comment: Corrected a mistake in v1 concerning squeezing amplification

We introduce a new family of quantum circuits in Continuous Variables and we show that, relying on the widely accepted conjecture that the polynomial hierarchy of complexity classes does not collapse, their output probability distribution cannot be efficiently simulated by a classical computer. These circuits are composed of input photon-subtracted (or photon-added) squeezed states, passive linear optics evolution, and eight-port homodyne detection. We address the proof of hardness for the exact probability distribution of these quantum circuits by exploiting mappings onto different architectures of sub-universal quantum computers. We obtain both a worst-case and an average-case hardness result. Hardness of Boson Sampling with eight-port homodyne detection is obtained as the zero squeezing limit of our model. We conclude with a discussion on the relevance and interest of the present model in connection to experimental applications and classical simulations., Comment: 11 pages, 6 figures

In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to realize in the lab. We propose and analyze two methods to apply a polynomial approximation of any unitary operator diagonal in the amplitude quadrature representation, including non-Gaussian operators, to an unknown input state. Our protocols use as a primary non-Gaussian resource a single-photon counter. We use the fidelity of the transformation with the target one on Fock and coherent states to assess the quality of the approximate gate., Comment: 11 pages, 7 figures

In this work we introduce a general scheme for measurement based quantum computation in continuous variables. Our approach does not necessarily rely on the use of ancillary cluster states to achieve its aim, but rather on the detection of a resource state in a suitable mode basis followed by digital post-processing, and involves an optimization of the adjustable experimental parameters. After introducing the general method, we present some examples of application to simple specific computations., Comment: Published version, Reference: Phys. Rev. A 94, 062332 (2016). arXiv admin note: text overlap with arXiv:1407.5318

We present a general strategy to derive entanglement criteria which consists in performing a mapping from qudits to qubits that preserves the separability of the parties and SU(2) rotational invariance. Consequently, it is possible to apply the well known positive partial transpose criterion to reveal the existence of quantum correlations between qudits. We discuss some examples of entangled states that are detected using the proposed strategy. Finally, we demonstrate, using our scheme, how some variance-based entanglement witnesses can be generalized from qubits to higher dimensional spin systems.

We present a scheme to realize versatile quantum networks by cascading several four-wave mixing (FWM) processes in warm rubidium vapors. FWM is an efficient $\chi^{(3)}$ nonlinear process, already used as a resource for multimode quantum state generation and which has been proved to be a promising candidate for applications to quantum information processing. We analyze theoretically the multimode output of cascaded FWM systems, derive its independent squeezed modes and show how, with phase controlled homodyne detection and digital post-processing, they can be turned into a versatile source of continuous variable cluster states., Comment: 7 pages, 6 figures, Quantum optics

In a two-mode Bose-Josephson junction formed by a binary mixture of ultracold atoms, macroscopic superpositions of phase states are produced during the time evolution after a sudden quench to zero of the coupling amplitude. Using quantum trajectories and an exact diagonalization of the master equation, we study the effect of one-, two-, and three-body atom losses on the superpositions by analyzing separately the amount of quantum correlations in each subspace with fixed atom number. The quantum correlations useful for atom interferometry are estimated using the quantum Fisher information. We identify the choice of parameters leading to the largest Fisher information, thereby showing that, for all kinds of loss processes, quantum correlations can be partially protected from decoherence when the losses are strongly asymmetric in the two modes., Comment: 23 pages, 8 figures, to be published in Eur. Phys. J. B

We present a detailed analysis of the multimode quantum state embedded in an optical frequency comb generated by a Synchronously Pumped Optical Parametric Oscillator (SPOPO). The full covariance matrix of the state is obtained with homodyne detection where the local oscillator is spectrally controlled with pulse shaping techniques. The resulting matrix reveals genuine multipartite entanglement. Additionally, the beam is comprised of several independent eigenmodes that correspond to specific pulse shapes. The experimental data is confirmed with numerical simulations. Finally, the potential to create continuous-variable cluster states from the quantum comb is analyzed. Multiple cluster states are shown to be simultaneously embedded in the SPOPO state, and these states can be revealed by a suitable basis change applied to the measured covariance matrix.

We study the possibility of producing and detecting continuous variable cluster states in an optical set-up in an extremely compact fashion. This method is based on a multi-pixel homodyne detection system recently demonstrated experimentally, which includes classical data post-processing. It allows to incorporate the linear optics network, usually employed in standard experiments for the production of cluster states, in the stage of the measurement. After giving an example of cluster state generation by this method, we further study how this procedure can be generalized to perform gaussian quantum computation., Comment: Eqs.(20)-(21) corrected

We study how macroscopic superpositions of coherent states produced by the nondissipative dynamics of binary mixtures of ultracold atoms are affected by atom losses. We identify different decoherence scenarios for symmetric or asymmetric loss rates and interaction energies in the two modes. In the symmetric case the quantum coherence in the superposition is lost after a single loss event. By tuning appropriately the energies we show that the superposition can be protected, leading to quantum correlations useful for atom interferometry even after many loss events., Comment: 6 pages, 3 figures

We show how to optimally control the creation of quantum superpositions in a bosonic Josephson junction within the two-site Bose-Hubbard model framework. Both geometric and purely numerical optimal control approaches are used, the former providing a generalization of the proposal of Micheli et al [Phys. Rev. A 67, 013607 (2003)]. While this method is shown not to lead to significant improvements in terms of time of formation and fidelity of the superposition, a numerical optimal control approach appears more promising, as it allows to create an almost perfect superposition, within a time short compared to other existing protocols. We analyze the robustness of the optimal solution against atom number variations. Finally, we discuss to which extent these optimal solutions could be implemented with the state of art technology., Comment: Several comments added, structure re-organized

In a two-mode Bose Josephson junction the dynamics induced by a sudden quench of the tunnel amplitude leads to the periodic formation of entangled states. For instance, squeezed states are formed at short times and macroscopic superpositions of phase states at later times. The two modes of the junction can be viewed as the two arms of an interferometer; use of entangled states allows to perform atom interferometry beyond the classical limit. Decoherence due to the presence of noise degrades the quantum correlations between the atoms, thus reducing phase sensitivity of the interferometer. We consider the noise induced by stochastic fluctuations of the energies of the two modes of the junction. We analyze its effect on squeezed states and macroscopic superpositions and study quantitatively the amount of quantum correlations which can be used to enhance the phase sensitivity with respect to the classical limit. To this aim we compute the squeezing parameter and the quantum Fisher information during the quenched dynamics. For moderate noise intensities we show that these useful quantum correlations increase on time scales beyond the squeezing regime. This suggests multicomponent superpositions as interesting candidates for high-precision atom interferometry.

For a Bose Josephson junction realized with a double-well potential we propose a strategy to observe the coherent superpositions of phase states occurring during the time evolution after a sudden rise of the barrier separating the two wells. We show that their phase content can be obtained by the full-counting statistics of the spin-boson operators characterizing the junction, which could be mapped out by repeated measurements of the population imbalance after rotation of the state. This measurement can distinguish between coherent superpositions and incoherent mixtures, and can be used for a two-dimensional, tomographic reconstruction of the phase content of the state., Comment: 5 pages, 3 figures