Quantum Bit Commitment with a Composite Evidence

Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a monolithic quantum system. We argue that more general evidence structures, allowing for a composite, hybrid (classical-quantum) evidence, conduce to improved security. In particular, we present and prove the security of the following protocol: Bob sends Alice an anonymous state. She inscribes her commitment $b$ by measuring part of it in the + (for $b = 0$) or $\times$ (for $b=1$) basis. She then communicates to him the (classical) measurement outcome $R_x$ and the part-measured anonymous state interpolated into other, randomly prepared qubits as her evidence-of-commitment.Comment: 6 pages, minor changes, journal reference adde

Optimal phase measurements with pure Gaussian states

We analyze the Heisenberg limit on phase estimation for Gaussian states. In the analysis, no reference to a phase operator is made. We prove that the squeezed vacuum state is the most sensitive for a given average photon number. We provide two adaptive local measurement schemes that attain the Heisenberg limit asymptotically. One of them is described by a positive operator-valued measure and its efficiency is exhaustively explored. We also study Gaussian measurement schemes based on phase quadrature measurements. We show that homodyne tomography of the appropriate quadrature attains the Heisenberg limit for large samples. This proves that this limit can be attained with local projective Von Neuman measurements.Comment: 9 pages. Revised version: two new sections added, revised conclusions. Corrected prose. Corrected reference

Coherence from multiorbital tunneling ionization of molecules

We present a simple and general coherence model for multiorbital tunnel ionization of molecules, which we incorporate into our previously developed density matrix approach for sequential double ionization [Yuen and Lin, Phys. Rev. A 106, 023120 (2022)]. The influence of this coherence is investigated through simulations of single ionization and sequential double ionization of N$_2$ and O$_2$ using few-cycle near-infrared laser pulses. In the case of single ionization, our results reveal the crucial role played by this coherence in generating population inversion in N$_2^+$, suggesting a potential mechanism for air lasing. Regarding sequential double ionization, we observe only minor changes in the kinetic energy release spectra when the coherence is included, while noticeable differences in the angle-dependent dication yield for both N$_2$ and O$_2$ are found. Based on these findings, we recommend the inclusion of multiorbital tunnel ionization coherence in models for single ionization of general molecules, while suggesting that it can be safely neglected in the case of sequential double ionization

Probing Vibronic Coherence in Charge Migration of Molecules Using Strong Field Sequential Double Ionization

We propose a novel scheme for probing vibronic coherence in charge migration in molecules utilizing strong field sequential double ionization. To demonstrate the feasibility of this approach, we perform full simulations of a pump-probe scheme employing few-cycle intense infrared pulses for N$_2$ and O$_2$. We predict that the vibronic coherence between the pumped states will be directly imprinted in experimental observables such as kinetic energy release spectra and branching ratios of the dissociative dications. Our simulations are based on the recently developed DM-SDI model, which is capable of efficiently accounting for molecular orientations and enabling direct comparison with experimental results. Our findings strongly encourage the use of this probing scheme in future charge migration experiments

Quantum Noise Randomized Ciphers

We review the notion of a classical random cipher and its advantages. We sharpen the usual description of random ciphers to a particular mathematical characterization suggested by the salient feature responsible for their increased security. We describe a concrete system known as AlphaEta and show that it is equivalent to a random cipher in which the required randomization is effected by coherent-state quantum noise. We describe the currently known security features of AlphaEta and similar systems, including lower bounds on the unicity distances against ciphertext-only and known-plaintext attacks. We show how AlphaEta used in conjunction with any standard stream cipher such as AES (Advanced Encryption Standard) provides an additional, qualitatively different layer of security from physical encryption against known-plaintext attacks on the key. We refute some claims in the literature that AlphaEta is equivalent to a non-random stream cipher.Comment: Accepted for publication in Phys. Rev. A; Discussion augmented and re-organized; Section 5 contains a detailed response to 'T. Nishioka, T. Hasegawa, H. Ishizuka, K. Imafuku, H. Imai: Phys. Lett. A 327 (2004) 28-32 /quant-ph/0310168' & 'T. Nishioka, T. Hasegawa, H. Ishizuka, K. Imafuku, H. Imai: Phys. Lett. A 346 (2005) 7

Topology design and performance analysis of an integrated communication network

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix

Phase-covariant cloning of coherent states

We consider the problem of phase-covariant cloning for coherent states. We show that an experimental scheme based on ideal phase measurement and feedforward outperforms the semiclassical procedure of ideal phase measurement and preparation in terms of fidelity. A realistic scheme where the ideal phase measurement is replaced with double-homodyne detection is shown to be unable to overcome the semiclassical cloning strategy. On the other hand, such a realistic scheme is better than semiclassical cloning based on double-homodyne phase measurement and preparation.Comment: 6 pages, 2 figures; updated references and minor corrections; in press on Physical Review

Quantum-state filtering applied to the discrimination of Boolean functions

Quantum state filtering is a variant of the unambiguous state discrimination problem: the states are grouped in sets and we want to determine to which particular set a given input state belongs.The simplest case, when the N given states are divided into two subsets and the first set consists of one state only while the second consists of all of the remaining states, is termed quantum state filtering. We derived previously the optimal strategy for the case of N non-orthogonal states, {|\psi_{1} >, ..., |\psi_{N} >}, for distinguishing |\psi_1 > from the set {|\psi_2 >, ..., |\psi_N >} and the corresponding optimal success and failure probabilities. In a previous paper [PRL 90, 257901 (2003)], we sketched an appplication of the results to probabilistic quantum algorithms. Here we fill in the gaps and give the complete derivation of the probabilstic quantum algorithm that can optimally distinguish between two classes of Boolean functions, that of the balanced functions and that of the biased functions. The algorithm is probabilistic, it fails sometimes but when it does it lets us know that it did. Our approach can be considered as a generalization of the Deutsch-Jozsa algorithm that was developed for the discrimination of balanced and constant Boolean functions.Comment: 8 page