test_qft.cpp File Reference

Tests for the quantum Fourier transform (QFT) implementation. More...

#include "catch2/catch.hpp"
#include "Simulator.hpp"
#include "IntelSimulator.cpp"
#include <memory>
#include "qft.hpp"
#include <bitset>

Include dependency graph for test_qft.cpp:

Go to the source code of this file.

Functions
	TEST_CASE ("QFT forward","[qft]")
	Test: QFT forward. More...
	TEST_CASE ("QFT inverse","[qft]")
	Test: QFT inverse. More...
	TEST_CASE ("QFT forward and inverse","[qft]")
	Test: QFT forward and inverse. More...

Detailed Description

Tests for the quantum Fourier transform (QFT) implementation.

Author

Lee J. O'Riordan (lee.o.nosp@m.rior.nosp@m.dan@i.nosp@m.chec.nosp@m..ie)

Version

0.1

Date

2019-05-13

Copyright

Copyright (c) 2019

Definition in file test_qft.cpp.

Function Documentation

TEST_CASE() [1/3]

TEST_CASE	(	"QFT forward"	,
		""	[qft]
	)

Test: QFT forward.

Definition at line 27 of file test_qft.cpp.

                                {
    std::size_t min_idx=0, max_idx=3;
    std::size_t num_qubits = max_idx - min_idx +1;
    IntelSimulator sim(num_qubits);
    SECTION("Full register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyQFT(min_idx, max_idx);
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == Approx( sqrt( 1. / num_qubits ) ) );
        }
    }
    SECTION("Sub register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyQFT(min_idx+1, max_idx);
        REQUIRE( r.GetProbability(min_idx) == 0.0 );
        for(std::size_t idx = min_idx+1; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == Approx( sqrt( 1. / (num_qubits-1) ) ) );
        }
    }
}

References ncu_opt_tester::num_qubits, and ncu_opt_tester::sim.

TEST_CASE() [2/3]

TEST_CASE	(	"QFT inverse"	,
		""	[qft]
	)

Test: QFT inverse.

Definition at line 58 of file test_qft.cpp.

                                {
    std::size_t min_idx=0, max_idx=3;
    std::size_t num_qubits = max_idx - min_idx +1;
    IntelSimulator sim(num_qubits);
    SECTION("Full register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyIQFT(min_idx, max_idx);
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == Approx( sqrt( 1. / num_qubits ) ) );
        }
    }
    SECTION("Sub register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyIQFT(min_idx+1, max_idx);
        REQUIRE( r.GetProbability(min_idx) == 0.0 );
        for(std::size_t idx = min_idx+1; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == Approx( sqrt( 1. / (num_qubits-1) ) ) );
        }
    }
}

References ncu_opt_tester::num_qubits, and ncu_opt_tester::sim.

TEST_CASE() [3/3]

TEST_CASE	(	"QFT forward and inverse"	,
		""	[qft]
	)

Test: QFT forward and inverse.

Definition at line 89 of file test_qft.cpp.

                                            {
    std::size_t min_idx=0, max_idx=3;
    std::size_t num_qubits = max_idx - min_idx +1;
    IntelSimulator sim(num_qubits);

    SECTION("Full register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyQFT(min_idx, max_idx);
        sim.applyIQFT(min_idx, max_idx);
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
    }
    SECTION("Sub register"){
        auto& r = sim.getQubitRegister();
        for(std::size_t idx = min_idx; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
        sim.applyQFT(min_idx+1, max_idx);
        sim.applyIQFT(min_idx+1, max_idx);
        for(std::size_t idx = min_idx+1; idx <= max_idx; idx++){
            REQUIRE( r.GetProbability(idx) == 0.0 );
        }
    }
}

References ncu_opt_tester::num_qubits, and ncu_opt_tester::sim.