20 results for “Entanglement generation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proposes a wavelength division multiplexing (WDM)-based entanglement distribution approach using multiple spontaneous parametric downconversion (SPDC) broadband entangled photon pair source…
This paper presents protocols for computing a linear combination over a noiseless quantum many-to-one network with more general linear transformations and lower communication cost.
The paper introduces a method using shared classical randomness to establish a strict representational separation over a shallow unitary Born model for quantum generative models, allowing for the gene…
The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…
This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.
This paper explores the constraints of achieving quantum advantage in circuit cutting while maintaining low overhead, classical hardness, and trainability, and introduces a two-block circuit family th…
Anurag K. S. V., Shubham Chouhan, K. Srinivasan, G. Raghavan +1 more
The paper presents a high-speed, phase-noise-based Quantum Random Number Generator (QRNG) that achieves a post-processed generation rate of 1.0 Gbps, suitable for real-time secure applications.
The paper proves that synthesizing a quantum circuit for a given Clifford operator using a specified amount of resources is NP-complete for several resource models.
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
The paper constructs a family of simple quantum states (pseudoentangled states) generated by constant-depth circuits that exhibit non-trivial entanglement structure, demonstrating that entanglement st…
This paper investigates the communication complexity of private simultaneous quantum messages for various functions.
This paper improves the efficiency of distributed quantum computing by concurrently executing multiple compilations of the same quantum circuit.
This paper simplifies the definition of qudit flow, a model of quantum computation, and improves its complexity to match qubit flows.
The paper introduces QADR, a novel hybrid quantum-classical framework that efficiently trains variational quantum circuits by localizing entanglement reduction, thereby overcoming the exponential memo…