Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1103.5324

Cloning of arbitrary mirror-symmetric distributions on Bloch sphere: Optimality proof and proposal for practical photonic realization

Karol Bartkiewicz·Adam Miranowicz
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study state-dependent quantum cloning which can outperform universal cloning. This is possible by using some a priori information on a given quantum state to be cloned. Specifically, we propose a generalization and optical implementation of quantum optimal mirror phase-covariant cloning, which refers to optimal cloning of sets of qubits of known modulus of expectation value of Pauli's Z operator. Our results can be applied for cloning of an arbitrary mirror-symmetric distribution of qubits on Bloch sphere including in special cases the universal cloning and phase-covariant cloning. We show that the cloning is optimal by adapting our former optimality proof for axisymmetric cloning [Phys. Rev. 82, 042330 (2010)]. Moreover, we propose an optical realization of the optimal mirror phase-covariant 1 to 2 cloning of a qubit, for which the mean probability of successful cloning varies from 1/6 to 1/3 depending on prior information on the set of qubits to be cloned. The qubits are represented by polarization states of photons generated by the type-I spontaneous parametric down-conversion. The scheme is based on the interference of two photons on an unbalanced polarization-dependent beam splitter with different splitting ratios for vertical and horizontal polarization components and the additional application of feedforward by means of Pockels cells. The experimental feasibility of the proposed setup is carefully studied including various kinds of imperfections and losses including: (i) finite efficiency of generating a pair of entangled photons in the type-I spontaneous parametric down conversion, (ii) the influence of choosing various splitting ratios of the unbalanced beam splitter, (iii) the application of conventional and single-photon discriminating detectors, (iv) dark counts and finite efficiency of the detectors.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karol Bartkiewicz, Adam Miranowicz. 2011-03-28. Cloning of arbitrary mirror-symmetric distributions on Bloch sphere: Optimality proof and proposal for practical photonic realization. https://doi.org/10.1088/0031-8949%2F2012%2Ft147%2F014003

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fermionic magic resources in disordered quantum spin chains

Fermionic non-Gaussianity quantifies a quantum state's deviation from a classically tractable free-fermionic description, constituting a necessary resource for computational quantum advantage. Here we use fermionic antiflatness (FAF) to measure this deviation across ergodic and many-body localized (MBL) regimes. We focus on the paradigmatic disordered spin-$1\!/2$ XXZ chain and its impurity variant with local interactions. Across highly excited eigenstates, FAF evolves from typical-state behavior at weak disorder to strongly suppressed values deep in the MBL regime, with volume-law scaling in the XXZ chain and an area-law bound in the impurity setting. Rare long-range cat-like eigenstates exhibit a pronounced enhancement of FAF, making it a sensitive diagnostic of mechanisms proposed to destabilize MBL. Starting from product states, we find that in the MBL regime FAF grows slowly in time, approaching saturation via a power-law relaxation. Overall, our results show that MBL suppresses fermionic non-Gaussianity, and the associated complexity beyond free fermions, while ergodicity restores it, motivating explorations of fermionic non-Gaussianity in other ergodicity-breaking phenomena.

quant-ph↗
arXiv2026

Progressive Binarization - Pauli Correlation Encoding: a Continuation Method for Constrained Optimization

Pauli Correlation Encoding (PCE) reduces the qubit requirements of quantum optimization by embedding the problem variables into the expectation values of Pauli observables, so that the number of qubits can be much smaller than the number of variables. PCE has not yet been studied for constrained optimization. We extend it to constrained combinatorial problems, using the budget-constrained MinCut as a case study, and show that the standard formulation fails to reliably enforce the constraint: feasibility hinges on the binarization of the encoded variables, which depends sensitively on hyperparameters that are hard to tune and do not transfer across instances. To address this, we introduce Progressive-Binarization PCE (PB-PCE), an adaptive continuation scheme that progressively increases the binarization parameter while re-optimizing the circuit from the previous solution, driving the variables towards the binary domain. PB-PCE attains near-complete constraint satisfaction (88--100\%) and smaller cut sizes than standard PCE, with a number of stages (10--20) essentially independent of problem size, solving instances of up to 300 variables with only 9-qubit circuits.

quant-ph↗
arXiv2026

A quantum model for synchronizing finite state transition systems

We propose a quantum model for finding a resetting input sequence (RS) which can take a finite state transition system (FA), to particular state independent of its current state. The complexity of finding such sequences for various types of FA can be NP-Hard or even PSPACE-Complete. To this end, we represent the FA states, inputs, and transition function in quantum space. Accordingly, we propose a model to represent the execution of an input sequence of a particular length $l$ starting form an initial FA state. The model is extended considering the application in superposition of all input sequences of length $l$ to an initial state of the FA. The model is further extended considering the application of all input sequences to all initial states of the FA capturing for every input sequence the collection (ordered list) of states reached by applying the sequence to all states of the FA. The amplitude amplification algorithm is then used as it combines similar collections of reached states while preserving all input sequences that reach these collections. A Grover search for a reached collection where its elements correspond to the same FA state provides a RS for the FA. Our approach offers a quadratic gain over the exponential complexity of traditional brute-force method, which is the only method that can be applied to a general FA class.

quant-ph↗