home.social

#hadamard_test — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #hadamard_test, aggregated by home.social.

  1. New #arXiv #preprint from the Quantum and Linear-Optical Computation group , at INL!! #QLOC_INL

    arxiv.org/abs/2310.06034

    By researcher Leonardo Novo!

    In their new work they are investigating the complexity of computing transition probabilities of Gaussian processes.

    Their proof stems from connecting it with the problem of Gaussian boson sampling, known to be hard.

    A neat by-product is a #Hadamard_test for continuous-variable systems.

  2. New #arXiv #preprint from the Quantum and Linear-Optical Computation group , at INL!! #QLOC_INL

    arxiv.org/abs/2310.06034

    By researcher Leonardo Novo!

    In their new work they are investigating the complexity of computing transition probabilities of Gaussian processes.

    Their proof stems from connecting it with the problem of Gaussian boson sampling, known to be hard.

    A neat by-product is a #Hadamard_test for continuous-variable systems.

  3. New #arXiv #preprint from the Quantum and Linear-Optical Computation group , at INL!! #QLOC_INL

    arxiv.org/abs/2310.06034

    By researcher Leonardo Novo!

    In their new work they are investigating the complexity of computing transition probabilities of Gaussian processes.

    Their proof stems from connecting it with the problem of Gaussian boson sampling, known to be hard.

    A neat by-product is a #Hadamard_test for continuous-variable systems.

  4. New #arXiv #preprint from the Quantum and Linear-Optical Computation group , at INL!! #QLOC_INL

    arxiv.org/abs/2310.06034

    By researcher Leonardo Novo!

    In their new work they are investigating the complexity of computing transition probabilities of Gaussian processes.

    Their proof stems from connecting it with the problem of Gaussian boson sampling, known to be hard.

    A neat by-product is a #Hadamard_test for continuous-variable systems.

  5. New #arXiv #preprint from the Quantum and Linear-Optical Computation group , at INL!! #QLOC_INL

    arxiv.org/abs/2310.06034

    By researcher Leonardo Novo!

    In their new work they are investigating the complexity of computing transition probabilities of Gaussian processes.

    Their proof stems from connecting it with the problem of Gaussian boson sampling, known to be hard.

    A neat by-product is a #Hadamard_test for continuous-variable systems.