Lunar navigation study, volume 2 Final report, Jan. - Dec. 1966

Performance data utilization in mission phase, lunar exploration phase, and navigational phase of lunar roving vehicle mission

Unconditionally verifiable blind computation

Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can verify with high probability whether the server has followed the instructions of the protocol, or if there has been some deviation resulting in a corrupted output state. A verifiable BQC protocol can be viewed as an interactive proof system leading to consequences for complexity theory. The authors, together with Broadbent, previously proposed a universal and unconditionally secure BQC scheme where the client only needs to be able to prepare single qubits in separable states randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. In this paper we extend that protocol with new functionality allowing blind computational basis measurements, which we use to construct a new verifiable BQC protocol based on a new class of resource states. We rigorously prove that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter. The new resource state allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead. This is a significant improvement on the original scheme, which required that all computations to be performed must first be put into a nearest neighbour form, incurring linear overhead in the number of qubits. Such an improvement has important consequences for efficiency and fault-tolerance thresholds.Comment: 46 pages, 10 figures. Additional protocol added which allows arbitrary circuits to be verified with polynomial securit

Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation

Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.Comment: (v3) 14 pages, 6 figures. expands introduction and definition of flow, corrects typos to increase readability; contains a new figure to illustrate example run of CDBQC protocol; minor changes to match the published version.(v2) 12 pages, 5 figures. Corrects motivation for quantities used in blindness analysi

Anonymous quantum communication

We present the first protocol for the anonymous transmission of a quantum state that is information-theoretically secure against an active adversary, without any assumption on the number of corrupt participants. The anonymity of the sender and receiver is perfectly preserved, and the privacy of the quantum state is protected except with exponentially small probability. Even though a single corrupt participant can cause the protocol to abort, the quantum state can only be destroyed with exponentially small probability: if the protocol succeeds, the state is transferred to the receiver and otherwise it remains in the hands of the sender (provided the receiver is honest).Comment: 11 pages, to appear in Proceedings of ASIACRYPT, 200

Genuinely Multipartite Concurrence of N-qubit X-matrices

We find an algebraic formula for the N-partite concurrence of N qubits in an X-matrix. X- matricies are density matrices whose only non-zero elements are diagonal or anti-diagonal when written in an orthonormal basis. We use our formula to study the dynamics of the N-partite entanglement of N remote qubits in generalized N-party Greenberger-Horne-Zeilinger (GHZ) states. We study the case when each qubit interacts with a partner harmonic oscillator. It is shown that only one type of GHZ state is prone to entanglement sudden death; for the rest, N-partite entanglement dies out momentarily. Algebraic formulas for the entanglement dynamics are given in both cases

Lunar navigation study, sections 1 through 7 Final report, Jun. 1964 - May 1965

Lunar navigation analysis using passive nongyro, inertial navigation, and radio frequency technolog

Lunar navigation study, summary volume Final report, Jun. 1964 - May 1965

Lunar surface navigation and guidance study to implement lunar surface vehicle exploration mission

Quantum computing on encrypted data

The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. Because our protocol requires few extra resources compared to other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems

Classical simulation of entanglement swapping with bounded communication

Entanglement appears under two different forms in quantum theory, namely as a property of states of joint systems and as a property of measurement eigenstates in joint measurements. By combining these two aspects of entanglement, it is possible to generate nonlocality between particles that never interacted, using the protocol of entanglement swapping. We show that even in the more constraining bilocal scenario where distant sources of particles are assumed to be independent, i.e. to share no prior randomness, this process can be simulated classically with bounded communication, using only 9 bits in total. Our result thus provides an upper bound on the nonlocality of the process of entanglement swapping.Comment: 6 pages, 1 figur

Rotational 3D Printing of Sensor Devices using Reactive Ink Chemistries

This paper charts progress in three key areas of a project supported by both UK government and UK industry to manufacture novel sensor devices using rotary 3D printing technology and innovative ink chemistries; (1) the development of an STL file slicing algorithm that returns constant Z height 2D contour data at a resolution that matches the given print head setup, allowing digital images to be generated of the correct size without the need for scaling; (2) the development of image transformation algorithms which allow images to be printed at higher resolutions using tilted print heads and; (3) the formulation of multi part reaction inks which combine and react on the substrate to form solid material layers with a finite thickness. A Direct Light Projection (DLP) technique demonstrated the robustness of the slice data by constructing fine detailed three dimensional test pieces which were comparable to identical parts built in an identical way from slice data obtained using commercial software. Material systems currently under investigation include plaster, stiff polyamides and epoxy polymers and conductive metallic’s. Early experimental results show conductivities of silver approaching 1.42x105 Siemens/m.Mechanical Engineerin